./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.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/fermat1-ll_unwindbound100.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 ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:09:51,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:09:51,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:09:51,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:09:51,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:09:51,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:09:51,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:09:51,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:09:51,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:09:51,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:09:51,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:09:51,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:09:51,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:09:51,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:09:51,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:09:51,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:09:51,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:09:51,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:09:51,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:09:51,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:09:51,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:09:51,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:09:51,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:09:51,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:09:51,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:09:51,279 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:09:51,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:09:51,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:09:51,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:09:51,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:09:51,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:09:51,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:09:51,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:09:51,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:09:51,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:09:51,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:09:51,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:09:51,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:09:51,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:09:51,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:09:51,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:09:51,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:09:51,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:09:51,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:09:51,285 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 -> ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d [2024-11-10 19:09:51,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:09:51,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:09:51,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:09:51,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:09:51,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:09:51,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2024-11-10 19:09:53,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:09:53,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:09:53,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2024-11-10 19:09:53,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac3d6aab/0450a7fd82cb4f5fa1e17804e2814032/FLAG0e85099f5 [2024-11-10 19:09:53,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac3d6aab/0450a7fd82cb4f5fa1e17804e2814032 [2024-11-10 19:09:53,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:09:53,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:09:53,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:09:53,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:09:53,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:09:53,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:53" (1/1) ... [2024-11-10 19:09:53,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9b1101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:53, skipping insertion in model container [2024-11-10 19:09:53,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:53" (1/1) ... [2024-11-10 19:09:53,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:09:53,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:09:53,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:09:54,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:09:54,055 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:09:54,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54 WrapperNode [2024-11-10 19:09:54,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:09:54,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:09:54,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:09:54,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:09:54,067 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:09:54" (1/1) ... [2024-11-10 19:09:54,095 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:09:54" (1/1) ... [2024-11-10 19:09:54,129 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2024-11-10 19:09:54,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:09:54,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:09:54,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:09:54,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:09:54,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,163 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:09:54,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:09:54,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:09:54,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:09:54,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:09:54,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (1/1) ... [2024-11-10 19:09:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:09:54,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:54,208 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:09:54,210 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:09:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:09:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:09:54,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:09:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:09:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:09:54,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:09:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:09:54,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:09:54,303 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:09:54,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:09:54,776 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-10 19:09:54,776 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:09:54,801 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:09:54,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:09:54,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:09:54 BoogieIcfgContainer [2024-11-10 19:09:54,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:09:54,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:09:54,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:09:54,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:09:54,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:09:53" (1/3) ... [2024-11-10 19:09:54,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661dc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:09:54, skipping insertion in model container [2024-11-10 19:09:54,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:54" (2/3) ... [2024-11-10 19:09:54,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661dc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:09:54, skipping insertion in model container [2024-11-10 19:09:54,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:09:54" (3/3) ... [2024-11-10 19:09:54,815 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2024-11-10 19:09:54,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:09:54,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-11-10 19:09:54,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:09:54,917 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;@6508c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:09:54,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-11-10 19:09:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 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:09:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 19:09:54,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:54,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 19:09:54,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 261127, now seen corresponding path program 1 times [2024-11-10 19:09:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325951453] [2024-11-10 19:09:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:09:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325951453] [2024-11-10 19:09:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325951453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471674489] [2024-11-10 19:09:55,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:55,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:55,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,126 INFO L87 Difference]: Start difference. First operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:55,246 INFO L93 Difference]: Finished difference Result 445 states and 489 transitions. [2024-11-10 19:09:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 19:09:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:55,260 INFO L225 Difference]: With dead ends: 445 [2024-11-10 19:09:55,260 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 19:09:55,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,266 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:55,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:09:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 19:09:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-10 19:09:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 124 states have (on average 1.717741935483871) internal successors, (213), 207 states have internal predecessors, (213), 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:09:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-11-10 19:09:55,319 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 3 [2024-11-10 19:09:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:55,319 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-11-10 19:09:55,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-11-10 19:09:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 19:09:55,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:55,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 19:09:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:09:55,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 8095135, now seen corresponding path program 1 times [2024-11-10 19:09:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138182863] [2024-11-10 19:09:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:09:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138182863] [2024-11-10 19:09:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138182863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467235085] [2024-11-10 19:09:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:55,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:55,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:55,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,370 INFO L87 Difference]: Start difference. First operand 215 states and 223 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:55,451 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-11-10 19:09:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:55,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 19:09:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:55,457 INFO L225 Difference]: With dead ends: 215 [2024-11-10 19:09:55,457 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 19:09:55,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,459 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 14 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:55,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:09:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 19:09:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-10 19:09:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 124 states have (on average 1.685483870967742) internal successors, (209), 203 states have internal predecessors, (209), 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:09:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2024-11-10 19:09:55,487 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 219 transitions. Word has length 4 [2024-11-10 19:09:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:55,488 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 219 transitions. [2024-11-10 19:09:55,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 219 transitions. [2024-11-10 19:09:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:09:55,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:55,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:09:55,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1504860389, now seen corresponding path program 1 times [2024-11-10 19:09:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176135613] [2024-11-10 19:09:55,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:09:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136194209] [2024-11-10 19:09:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:55,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:55,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:55,509 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:09:55,511 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:09:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:55,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:09:55,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:09:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:09:55,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:09:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176135613] [2024-11-10 19:09:55,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:09:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136194209] [2024-11-10 19:09:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136194209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679544246] [2024-11-10 19:09:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,641 INFO L87 Difference]: Start difference. First operand 211 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:55,681 INFO L93 Difference]: Finished difference Result 211 states and 219 transitions. [2024-11-10 19:09:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:55,682 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 19:09:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:55,683 INFO L225 Difference]: With dead ends: 211 [2024-11-10 19:09:55,683 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 19:09:55,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:55,684 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:55,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 395 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:09:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 19:09:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 19:09:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.6693548387096775) internal successors, (207), 201 states have internal predecessors, (207), 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:09:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 217 transitions. [2024-11-10 19:09:55,696 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 217 transitions. Word has length 8 [2024-11-10 19:09:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 217 transitions. [2024-11-10 19:09:55,697 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:09:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 217 transitions. [2024-11-10 19:09:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 19:09:55,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:55,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:55,720 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:09:55,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:55,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 286219215, now seen corresponding path program 1 times [2024-11-10 19:09:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67001169] [2024-11-10 19:09:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:09:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441447244] [2024-11-10 19:09:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:55,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:55,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:55,956 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:09:55,963 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:09:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:56,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:09:56,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:09:56,078 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:09:56,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:09:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67001169] [2024-11-10 19:09:56,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:09:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441447244] [2024-11-10 19:09:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441447244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:56,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49817051] [2024-11-10 19:09:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:56,082 INFO L87 Difference]: Start difference. First operand 209 states and 217 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:56,139 INFO L93 Difference]: Finished difference Result 209 states and 217 transitions. [2024-11-10 19:09:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-10 19:09:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:56,140 INFO L225 Difference]: With dead ends: 209 [2024-11-10 19:09:56,142 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 19:09:56,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:09:56,143 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 170 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:56,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 196 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:09:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 19:09:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-10 19:09:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.653225806451613) internal successors, (205), 199 states have internal predecessors, (205), 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:09:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 215 transitions. [2024-11-10 19:09:56,163 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 215 transitions. Word has length 26 [2024-11-10 19:09:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 215 transitions. [2024-11-10 19:09:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 215 transitions. [2024-11-10 19:09:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 19:09:56,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:56,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:56,183 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:09:56,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 19:09:56,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:56,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 282861244, now seen corresponding path program 1 times [2024-11-10 19:09:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705302578] [2024-11-10 19:09:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:09:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:56,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705302578] [2024-11-10 19:09:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705302578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:09:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122156978] [2024-11-10 19:09:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:56,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:56,684 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:09:56,686 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:09:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:56,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:09:56,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:09:57,184 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:09:57,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:09:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122156978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:09:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 19:09:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129332696] [2024-11-10 19:09:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:57,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:09:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:57,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:09:57,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:09:57,187 INFO L87 Difference]: Start difference. First operand 207 states and 215 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:09:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:57,308 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2024-11-10 19:09:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:09:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-10 19:09:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:57,310 INFO L225 Difference]: With dead ends: 207 [2024-11-10 19:09:57,310 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 19:09:57,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:09:57,311 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 170 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:57,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 706 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:09:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 19:09:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-10 19:09:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 197 states have internal predecessors, (203), 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:09:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2024-11-10 19:09:57,335 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 27 [2024-11-10 19:09:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:57,336 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2024-11-10 19:09:57,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:09:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2024-11-10 19:09:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 19:09:57,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:57,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:57,353 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:09:57,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:57,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash -6346004, now seen corresponding path program 1 times [2024-11-10 19:09:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:57,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279802532] [2024-11-10 19:09:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,632 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:09:57,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279802532] [2024-11-10 19:09:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279802532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:09:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137379837] [2024-11-10 19:09:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:57,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:09:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:09:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:09:57,636 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:57,678 INFO L93 Difference]: Finished difference Result 286 states and 295 transitions. [2024-11-10 19:09:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:09:57,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-10 19:09:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:57,680 INFO L225 Difference]: With dead ends: 286 [2024-11-10 19:09:57,680 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:09:57,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:09:57,681 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 87 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:57,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:09:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:09:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 233. [2024-11-10 19:09:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 224 states have internal predecessors, (247), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2024-11-10 19:09:57,694 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 30 [2024-11-10 19:09:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2024-11-10 19:09:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2024-11-10 19:09:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 19:09:57,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:57,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:09:57,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash -196725960, now seen corresponding path program 1 times [2024-11-10 19:09:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137639703] [2024-11-10 19:09:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,759 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:09:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137639703] [2024-11-10 19:09:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137639703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:57,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:09:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786348405] [2024-11-10 19:09:57,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:57,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:09:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:09:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:09:57,762 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:57,798 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2024-11-10 19:09:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:09:57,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-10 19:09:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:57,802 INFO L225 Difference]: With dead ends: 262 [2024-11-10 19:09:57,802 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 19:09:57,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:09:57,803 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 10 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:57,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 593 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:09:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 19:09:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-10 19:09:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6333333333333333) internal successors, (245), 224 states have internal predecessors, (245), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 257 transitions. [2024-11-10 19:09:57,812 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 257 transitions. Word has length 31 [2024-11-10 19:09:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:57,812 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 257 transitions. [2024-11-10 19:09:57,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 257 transitions. [2024-11-10 19:09:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:09:57,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:57,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:09:57,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:57,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1967446504, now seen corresponding path program 1 times [2024-11-10 19:09:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185073218] [2024-11-10 19:09:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,859 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:09:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185073218] [2024-11-10 19:09:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185073218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205385562] [2024-11-10 19:09:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:57,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:57,865 INFO L87 Difference]: Start difference. First operand 233 states and 257 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:57,938 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2024-11-10 19:09:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:57,939 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-10 19:09:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:57,940 INFO L225 Difference]: With dead ends: 288 [2024-11-10 19:09:57,941 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:09:57,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:57,942 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 145 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:57,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 287 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:09:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:09:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 251. [2024-11-10 19:09:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2024-11-10 19:09:57,952 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 34 [2024-11-10 19:09:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:57,952 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2024-11-10 19:09:57,952 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2024-11-10 19:09:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:09:57,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:57,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:09:57,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 861299637, now seen corresponding path program 1 times [2024-11-10 19:09:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150696277] [2024-11-10 19:09:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:57,998 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:09:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150696277] [2024-11-10 19:09:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150696277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:57,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:09:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135528799] [2024-11-10 19:09:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:58,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:09:58,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:09:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:09:58,001 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:58,132 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2024-11-10 19:09:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:09:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-10 19:09:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:58,134 INFO L225 Difference]: With dead ends: 291 [2024-11-10 19:09:58,134 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 19:09:58,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:09:58,135 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:58,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 446 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:09:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 19:09:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 254. [2024-11-10 19:09:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 245 states have internal predecessors, (273), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-10 19:09:58,148 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 35 [2024-11-10 19:09:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:58,148 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-10 19:09:58,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-10 19:09:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:09:58,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:58,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:09:58,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 930485126, now seen corresponding path program 1 times [2024-11-10 19:09:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676471871] [2024-11-10 19:09:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:58,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:09:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154914084] [2024-11-10 19:09:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:58,170 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:09:58,172 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:09:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:58,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:09:58,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:09:58,268 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:09:58,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:09:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676471871] [2024-11-10 19:09:58,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:09:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154914084] [2024-11-10 19:09:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154914084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:09:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:09:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:09:58,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839162096] [2024-11-10 19:09:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:09:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:09:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:09:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:09:58,270 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:58,410 INFO L93 Difference]: Finished difference Result 408 states and 454 transitions. [2024-11-10 19:09:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:09:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-10 19:09:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:58,413 INFO L225 Difference]: With dead ends: 408 [2024-11-10 19:09:58,413 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 19:09:58,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:09:58,414 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:58,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 374 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:09:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 19:09:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 329. [2024-11-10 19:09:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 243 states have (on average 1.625514403292181) internal successors, (395), 317 states have internal predecessors, (395), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:09:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 413 transitions. [2024-11-10 19:09:58,433 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 413 transitions. Word has length 36 [2024-11-10 19:09:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:58,433 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 413 transitions. [2024-11-10 19:09:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:09:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 413 transitions. [2024-11-10 19:09:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:09:58,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:58,438 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:58,456 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:09:58,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:58,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:09:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:09:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1219732013, now seen corresponding path program 1 times [2024-11-10 19:09:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:09:58,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545587480] [2024-11-10 19:09:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:09:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:09:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:58,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:09:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:09:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:09:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545587480] [2024-11-10 19:09:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545587480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:09:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889810986] [2024-11-10 19:09:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:09:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:09:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:58,831 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:09:58,832 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:09:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:09:58,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:09:58,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:09:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:09:59,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:09:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:09:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889810986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:09:59,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:09:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 19:09:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678863387] [2024-11-10 19:09:59,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:09:59,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:09:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:09:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:09:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:09:59,371 INFO L87 Difference]: Start difference. First operand 329 states and 413 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:09:59,808 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2024-11-10 19:09:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:09:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-10 19:09:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:09:59,812 INFO L225 Difference]: With dead ends: 448 [2024-11-10 19:09:59,812 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 19:09:59,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:09:59,813 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 886 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:09:59,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1302 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:09:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 19:09:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 335. [2024-11-10 19:09:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 249 states have (on average 1.606425702811245) internal successors, (400), 323 states have internal predecessors, (400), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:09:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 418 transitions. [2024-11-10 19:09:59,850 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 418 transitions. Word has length 37 [2024-11-10 19:09:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:09:59,850 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 418 transitions. [2024-11-10 19:09:59,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:09:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 418 transitions. [2024-11-10 19:09:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 19:09:59,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:09:59,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:09:59,869 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:10:00,055 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,SelfDestructingSolverStorable10 [2024-11-10 19:10:00,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:00,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 363612145, now seen corresponding path program 1 times [2024-11-10 19:10:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:00,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492487662] [2024-11-10 19:10:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615681790] [2024-11-10 19:10:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:00,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:00,070 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:10:00,071 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:10:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:00,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:00,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:00,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492487662] [2024-11-10 19:10:00,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615681790] [2024-11-10 19:10:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615681790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:00,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-10 19:10:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130495361] [2024-11-10 19:10:00,453 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:10:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:10:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:10:00,454 INFO L87 Difference]: Start difference. First operand 335 states and 418 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,594 INFO L93 Difference]: Finished difference Result 525 states and 642 transitions. [2024-11-10 19:10:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:10:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-10 19:10:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,596 INFO L225 Difference]: With dead ends: 525 [2024-11-10 19:10:03,597 INFO L226 Difference]: Without dead ends: 498 [2024-11-10 19:10:03,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:03,598 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 451 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 545 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 19:10:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-10 19:10:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 463. [2024-11-10 19:10:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 374 states have (on average 1.5133689839572193) internal successors, (566), 448 states have internal predecessors, (566), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:10:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 590 transitions. [2024-11-10 19:10:03,627 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 590 transitions. Word has length 39 [2024-11-10 19:10:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,628 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 590 transitions. [2024-11-10 19:10:03,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 590 transitions. [2024-11-10 19:10:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:10:03,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,629 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:03,648 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:10:03,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1538925071, now seen corresponding path program 1 times [2024-11-10 19:10:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889601295] [2024-11-10 19:10:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045206023] [2024-11-10 19:10:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:03,851 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:10:03,854 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:10:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:03,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:03,923 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:10:03,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889601295] [2024-11-10 19:10:03,924 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045206023] [2024-11-10 19:10:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045206023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882094031] [2024-11-10 19:10:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,927 INFO L87 Difference]: Start difference. First operand 463 states and 590 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:04,169 INFO L93 Difference]: Finished difference Result 667 states and 835 transitions. [2024-11-10 19:10:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-10 19:10:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:04,172 INFO L225 Difference]: With dead ends: 667 [2024-11-10 19:10:04,172 INFO L226 Difference]: Without dead ends: 626 [2024-11-10 19:10:04,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:10:04,175 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:04,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 320 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-10 19:10:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 592. [2024-11-10 19:10:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 500 states have (on average 1.456) internal successors, (728), 574 states have internal predecessors, (728), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 19:10:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 758 transitions. [2024-11-10 19:10:04,204 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 758 transitions. Word has length 41 [2024-11-10 19:10:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:04,204 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 758 transitions. [2024-11-10 19:10:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 758 transitions. [2024-11-10 19:10:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 19:10:04,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:04,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:10:04,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:04,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -725034534, now seen corresponding path program 1 times [2024-11-10 19:10:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221126734] [2024-11-10 19:10:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,522 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:10:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221126734] [2024-11-10 19:10:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221126734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184467163] [2024-11-10 19:10:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:04,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:04,524 INFO L87 Difference]: Start difference. First operand 592 states and 758 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:04,622 INFO L93 Difference]: Finished difference Result 688 states and 867 transitions. [2024-11-10 19:10:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:10:04,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-10 19:10:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:04,626 INFO L225 Difference]: With dead ends: 688 [2024-11-10 19:10:04,626 INFO L226 Difference]: Without dead ends: 687 [2024-11-10 19:10:04,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:04,627 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:04,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 796 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-10 19:10:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 658. [2024-11-10 19:10:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4440497335701599) internal successors, (813), 636 states have internal predecessors, (813), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 847 transitions. [2024-11-10 19:10:04,662 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 847 transitions. Word has length 59 [2024-11-10 19:10:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:04,663 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 847 transitions. [2024-11-10 19:10:04,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 847 transitions. [2024-11-10 19:10:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 19:10:04,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:04,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:10:04,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1001233958, now seen corresponding path program 1 times [2024-11-10 19:10:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184822585] [2024-11-10 19:10:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,744 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:10:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184822585] [2024-11-10 19:10:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184822585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:04,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:04,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786845936] [2024-11-10 19:10:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:04,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:04,747 INFO L87 Difference]: Start difference. First operand 658 states and 847 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:04,839 INFO L93 Difference]: Finished difference Result 1198 states and 1552 transitions. [2024-11-10 19:10:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:10:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-10 19:10:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:04,842 INFO L225 Difference]: With dead ends: 1198 [2024-11-10 19:10:04,842 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 19:10:04,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:04,844 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 18 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:04,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 958 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 19:10:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-10 19:10:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4404973357015987) internal successors, (811), 636 states have internal predecessors, (811), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 845 transitions. [2024-11-10 19:10:04,883 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 845 transitions. Word has length 60 [2024-11-10 19:10:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:04,884 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 845 transitions. [2024-11-10 19:10:04,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 845 transitions. [2024-11-10 19:10:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 19:10:04,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:04,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 19:10:04,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1954930230, now seen corresponding path program 1 times [2024-11-10 19:10:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118554581] [2024-11-10 19:10:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118554581] [2024-11-10 19:10:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118554581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804878238] [2024-11-10 19:10:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:04,991 INFO L87 Difference]: Start difference. First operand 658 states and 845 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,248 INFO L93 Difference]: Finished difference Result 694 states and 849 transitions. [2024-11-10 19:10:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-10 19:10:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,252 INFO L225 Difference]: With dead ends: 694 [2024-11-10 19:10:05,253 INFO L226 Difference]: Without dead ends: 693 [2024-11-10 19:10:05,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:10:05,254 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-10 19:10:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 658. [2024-11-10 19:10:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4351687388987566) internal successors, (808), 636 states have internal predecessors, (808), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 842 transitions. [2024-11-10 19:10:05,290 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 842 transitions. Word has length 87 [2024-11-10 19:10:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,290 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 842 transitions. [2024-11-10 19:10:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 842 transitions. [2024-11-10 19:10:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:05,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 19:10:05,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 473293775, now seen corresponding path program 1 times [2024-11-10 19:10:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275221563] [2024-11-10 19:10:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275221563] [2024-11-10 19:10:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275221563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815847769] [2024-11-10 19:10:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:05,446 INFO L87 Difference]: Start difference. First operand 658 states and 842 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,607 INFO L93 Difference]: Finished difference Result 663 states and 845 transitions. [2024-11-10 19:10:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-10 19:10:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,610 INFO L225 Difference]: With dead ends: 663 [2024-11-10 19:10:05,610 INFO L226 Difference]: Without dead ends: 660 [2024-11-10 19:10:05,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:05,611 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 294 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 871 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-10 19:10:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2024-11-10 19:10:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 566 states have (on average 1.3975265017667844) internal successors, (791), 636 states have internal predecessors, (791), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 825 transitions. [2024-11-10 19:10:05,640 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 825 transitions. Word has length 88 [2024-11-10 19:10:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 825 transitions. [2024-11-10 19:10:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 825 transitions. [2024-11-10 19:10:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:05,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 19:10:05,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 473295056, now seen corresponding path program 1 times [2024-11-10 19:10:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182379959] [2024-11-10 19:10:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182379959] [2024-11-10 19:10:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182379959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:10:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478681890] [2024-11-10 19:10:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:05,732 INFO L87 Difference]: Start difference. First operand 659 states and 825 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:06,167 INFO L93 Difference]: Finished difference Result 704 states and 850 transitions. [2024-11-10 19:10:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-10 19:10:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:06,171 INFO L225 Difference]: With dead ends: 704 [2024-11-10 19:10:06,172 INFO L226 Difference]: Without dead ends: 703 [2024-11-10 19:10:06,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:10:06,173 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 376 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:06,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 337 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:10:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-10 19:10:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2024-11-10 19:10:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 566 states have (on average 1.392226148409894) internal successors, (788), 636 states have internal predecessors, (788), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 822 transitions. [2024-11-10 19:10:06,206 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 822 transitions. Word has length 88 [2024-11-10 19:10:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:06,206 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 822 transitions. [2024-11-10 19:10:06,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 822 transitions. [2024-11-10 19:10:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 19:10:06,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:06,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:06,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 19:10:06,208 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:06,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1787205195, now seen corresponding path program 1 times [2024-11-10 19:10:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27719212] [2024-11-10 19:10:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27719212] [2024-11-10 19:10:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27719212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:06,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282525136] [2024-11-10 19:10:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:06,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:06,319 INFO L87 Difference]: Start difference. First operand 659 states and 822 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:06,444 INFO L93 Difference]: Finished difference Result 1215 states and 1522 transitions. [2024-11-10 19:10:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 89 [2024-11-10 19:10:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:06,447 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 19:10:06,447 INFO L226 Difference]: Without dead ends: 674 [2024-11-10 19:10:06,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:06,449 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 37 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:06,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1290 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-10 19:10:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 668. [2024-11-10 19:10:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 574 states have (on average 1.386759581881533) internal successors, (796), 644 states have internal predecessors, (796), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 830 transitions. [2024-11-10 19:10:06,476 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 830 transitions. Word has length 89 [2024-11-10 19:10:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:06,477 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 830 transitions. [2024-11-10 19:10:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 830 transitions. [2024-11-10 19:10:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 19:10:06,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:06,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:06,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 19:10:06,478 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -572581879, now seen corresponding path program 1 times [2024-11-10 19:10:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78955823] [2024-11-10 19:10:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78955823] [2024-11-10 19:10:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78955823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036677797] [2024-11-10 19:10:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:06,587 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:10:06,588 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:10:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:06,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:06,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036677797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:06,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-11-10 19:10:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898422708] [2024-11-10 19:10:06,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:06,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:06,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:06,905 INFO L87 Difference]: Start difference. First operand 668 states and 830 transitions. Second operand has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:07,127 INFO L93 Difference]: Finished difference Result 1122 states and 1369 transitions. [2024-11-10 19:10:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 19:10:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 95 [2024-11-10 19:10:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:07,131 INFO L225 Difference]: With dead ends: 1122 [2024-11-10 19:10:07,131 INFO L226 Difference]: Without dead ends: 785 [2024-11-10 19:10:07,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-10 19:10:07,132 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 118 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:07,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1666 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-10 19:10:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 742. [2024-11-10 19:10:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 644 states have (on average 1.3928571428571428) internal successors, (897), 714 states have internal predecessors, (897), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 19:10:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 935 transitions. [2024-11-10 19:10:07,165 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 935 transitions. Word has length 95 [2024-11-10 19:10:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:07,166 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 935 transitions. [2024-11-10 19:10:07,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 935 transitions. [2024-11-10 19:10:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 19:10:07,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:07,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:07,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 19:10:07,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:07,369 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:07,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1823456583, now seen corresponding path program 1 times [2024-11-10 19:10:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134976689] [2024-11-10 19:10:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134976689] [2024-11-10 19:10:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134976689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500128827] [2024-11-10 19:10:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:07,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:07,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:07,503 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:10:07,504 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:10:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:07,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:07,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500128827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:07,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 19:10:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954764512] [2024-11-10 19:10:07,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:07,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:07,975 INFO L87 Difference]: Start difference. First operand 742 states and 935 transitions. Second operand has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:10:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:09,409 INFO L93 Difference]: Finished difference Result 1958 states and 2424 transitions. [2024-11-10 19:10:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:10:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 98 [2024-11-10 19:10:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:09,415 INFO L225 Difference]: With dead ends: 1958 [2024-11-10 19:10:09,415 INFO L226 Difference]: Without dead ends: 1417 [2024-11-10 19:10:09,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-10 19:10:09,418 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 2132 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:09,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 1022 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 19:10:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-10 19:10:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1079. [2024-11-10 19:10:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 971 states have (on average 1.3861997940267765) internal successors, (1346), 1040 states have internal predecessors, (1346), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 19:10:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1406 transitions. [2024-11-10 19:10:09,472 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1406 transitions. Word has length 98 [2024-11-10 19:10:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:09,472 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1406 transitions. [2024-11-10 19:10:09,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:10:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1406 transitions. [2024-11-10 19:10:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 19:10:09,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:09,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:09,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:09,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:09,674 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:09,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 692579334, now seen corresponding path program 1 times [2024-11-10 19:10:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432704256] [2024-11-10 19:10:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:09,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432704256] [2024-11-10 19:10:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432704256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044689699] [2024-11-10 19:10:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:09,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:09,802 INFO L229 MonitoredProcess]: Starting monitored process 11 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:10:09,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 19:10:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:09,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:19,312 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-11-10 19:10:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-11-10 19:10:19,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044689699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:20,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-10 19:10:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189231701] [2024-11-10 19:10:20,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=105, Unknown=7, NotChecked=22, Total=182 [2024-11-10 19:10:20,596 INFO L87 Difference]: Start difference. First operand 1079 states and 1406 transitions. Second operand has 14 states, 13 states have (on average 16.846153846153847) internal successors, (219), 14 states have internal predecessors, (219), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 19:10:32,026 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:10:33,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:34,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:35,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:36,535 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:10:40,549 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:10:45,550 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:10:46,662 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:10:52,659 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:10:56,663 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:11:00,683 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:11:01,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:05,741 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:11:09,753 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:11:16,078 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:11:20,087 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:11:24,114 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:11:28,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]