./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32da3d6d63cd0b5044f81aaa321c86b8663ab47e67a0d6b64aca0030551d2e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:47:38,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:47:38,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:47:38,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:47:38,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:47:38,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:47:38,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:47:38,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:47:38,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:47:38,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:47:38,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:47:38,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:47:38,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:47:38,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:47:38,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:47:38,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:47:38,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:47:38,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:47:38,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:47:38,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:47:38,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:47:38,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:47:38,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:47:38,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:47:38,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:47:38,952 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:47:38,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:47:38,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:47:38,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:47:38,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:47:38,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:47:38,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:47:38,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:47:38,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:47:38,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:38,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:47:38,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:47:38,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:47:38,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:47:38,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:47:38,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:47:38,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:47:38,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:47:38,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:47:38,958 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d32da3d6d63cd0b5044f81aaa321c86b8663ab47e67a0d6b64aca0030551d2e0 [2024-10-11 20:47:39,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:47:39,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:47:39,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:47:39,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:47:39,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:47:39,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c [2024-10-11 20:47:40,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:47:40,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:47:40,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c [2024-10-11 20:47:40,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9aa0aaa3/0e654822147f42a691b952c7cb386b57/FLAG8342552f2 [2024-10-11 20:47:40,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9aa0aaa3/0e654822147f42a691b952c7cb386b57 [2024-10-11 20:47:40,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:47:40,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:47:40,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:40,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:47:40,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:47:40,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:40" (1/1) ... [2024-10-11 20:47:40,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44612ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:40, skipping insertion in model container [2024-10-11 20:47:40,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:40" (1/1) ... [2024-10-11 20:47:40,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:47:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:41,192 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:47:41,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:41,229 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:47:41,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41 WrapperNode [2024-10-11 20:47:41,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:41,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:41,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:47:41,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:47:41,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,276 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2024-10-11 20:47:41,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:41,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:47:41,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:47:41,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:47:41,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,308 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:47:41,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:47:41,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:47:41,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:47:41,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:47:41,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (1/1) ... [2024-10-11 20:47:41,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:41,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:47:41,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:47:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:47:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:47:41,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:47:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:47:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:47:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:47:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:47:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:47:41,465 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:47:41,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:47:41,822 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-11 20:47:41,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:47:41,859 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:47:41,859 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:47:41,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:41 BoogieIcfgContainer [2024-10-11 20:47:41,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:47:41,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:47:41,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:47:41,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:47:41,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:47:40" (1/3) ... [2024-10-11 20:47:41,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35a8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:41, skipping insertion in model container [2024-10-11 20:47:41,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:41" (2/3) ... [2024-10-11 20:47:41,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35a8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:41, skipping insertion in model container [2024-10-11 20:47:41,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:41" (3/3) ... [2024-10-11 20:47:41,872 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound50.c [2024-10-11 20:47:41,889 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:47:41,889 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-10-11 20:47:41,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:47:41,968 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;@4de64718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:47:41,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-11 20:47:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 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-10-11 20:47:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:41,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:41,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:41,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2141259048, now seen corresponding path program 1 times [2024-10-11 20:47:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481655978] [2024-10-11 20:47:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481655978] [2024-10-11 20:47:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481655978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:42,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:42,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975614274] [2024-10-11 20:47:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:42,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:47:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:47:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:47:42,191 INFO L87 Difference]: Start difference. First operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:42,221 INFO L93 Difference]: Finished difference Result 258 states and 287 transitions. [2024-10-11 20:47:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:47:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:47:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:42,230 INFO L225 Difference]: With dead ends: 258 [2024-10-11 20:47:42,230 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:47:42,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:47:42,236 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:42,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:47:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-11 20:47:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2024-10-11 20:47:42,274 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 13 [2024-10-11 20:47:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:42,274 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2024-10-11 20:47:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2024-10-11 20:47:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:42,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:42,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:42,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:47:42,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:42,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1748291620, now seen corresponding path program 1 times [2024-10-11 20:47:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749741018] [2024-10-11 20:47:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749741018] [2024-10-11 20:47:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749741018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557574364] [2024-10-11 20:47:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:42,377 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:42,436 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2024-10-11 20:47:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:47:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:42,440 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:47:42,442 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 20:47:42,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:42,444 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:42,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 20:47:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 20:47:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 112 states have internal predecessors, (114), 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-10-11 20:47:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2024-10-11 20:47:42,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 13 [2024-10-11 20:47:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:42,470 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-10-11 20:47:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2024-10-11 20:47:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:47:42,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:42,471 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:42,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:47:42,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:42,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1637534589, now seen corresponding path program 1 times [2024-10-11 20:47:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880270222] [2024-10-11 20:47:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880270222] [2024-10-11 20:47:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880270222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945168657] [2024-10-11 20:47:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:42,555 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:42,620 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-10-11 20:47:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:47:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:42,622 INFO L225 Difference]: With dead ends: 120 [2024-10-11 20:47:42,622 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 20:47:42,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:42,624 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:42,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 20:47:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 20:47:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 108 states have internal predecessors, (110), 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-10-11 20:47:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2024-10-11 20:47:42,635 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 14 [2024-10-11 20:47:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2024-10-11 20:47:42,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2024-10-11 20:47:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:47:42,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:42,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:42,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:47:42,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:42,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -940276409, now seen corresponding path program 1 times [2024-10-11 20:47:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991566354] [2024-10-11 20:47:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040301470] [2024-10-11 20:47:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:42,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:42,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:42,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:42,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:47:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:42,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:42,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:47:42,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:42,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991566354] [2024-10-11 20:47:42,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040301470] [2024-10-11 20:47:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040301470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:42,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104874237] [2024-10-11 20:47:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:42,876 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 20:47:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:42,968 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2024-10-11 20:47:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2024-10-11 20:47:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:42,970 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:47:42,970 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:47:42,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:42,971 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:42,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:47:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:47:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 106 states have internal predecessors, (108), 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-10-11 20:47:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:42,991 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 18 [2024-10-11 20:47:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:42,991 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:42,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 20:47:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:47:42,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:42,996 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:43,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:47:43,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:43,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1891501742, now seen corresponding path program 1 times [2024-10-11 20:47:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437228488] [2024-10-11 20:47:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637608399] [2024-10-11 20:47:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:43,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:43,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:47:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:43,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:43,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:43,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437228488] [2024-10-11 20:47:43,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637608399] [2024-10-11 20:47:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637608399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:43,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:47:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635380727] [2024-10-11 20:47:43,510 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:43,512 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:43,574 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-11 20:47:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:43,576 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:43,576 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:47:43,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:43,577 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:43,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 287 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:47:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 20:47:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 103 states have internal predecessors, (105), 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-10-11 20:47:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-10-11 20:47:43,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 35 [2024-10-11 20:47:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:43,591 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-10-11 20:47:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-10-11 20:47:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:47:43,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:43,596 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:43,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:47:43,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:43,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:43,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1492988077, now seen corresponding path program 1 times [2024-10-11 20:47:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:43,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395692248] [2024-10-11 20:47:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395692248] [2024-10-11 20:47:44,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395692248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140749620] [2024-10-11 20:47:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:44,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:44,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:47:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:47:44,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:44,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140749620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:47:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176437263] [2024-10-11 20:47:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:44,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:47:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:47:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:44,306 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:44,413 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-10-11 20:47:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:47:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-11 20:47:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:44,415 INFO L225 Difference]: With dead ends: 111 [2024-10-11 20:47:44,415 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 20:47:44,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:44,416 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:44,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 366 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 20:47:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 20:47:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 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-10-11 20:47:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2024-10-11 20:47:44,424 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 36 [2024-10-11 20:47:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:44,424 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2024-10-11 20:47:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2024-10-11 20:47:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:47:44,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:44,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:44,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:47:44,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:44,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:44,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -242462763, now seen corresponding path program 1 times [2024-10-11 20:47:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:44,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400731884] [2024-10-11 20:47:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400731884] [2024-10-11 20:47:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400731884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:44,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371646765] [2024-10-11 20:47:44,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:44,710 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:44,752 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2024-10-11 20:47:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-10-11 20:47:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:44,754 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:47:44,754 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:47:44,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:44,755 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:44,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:47:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 20:47:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 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-10-11 20:47:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2024-10-11 20:47:44,762 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 38 [2024-10-11 20:47:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:44,763 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2024-10-11 20:47:44,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2024-10-11 20:47:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:47:44,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:44,768 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:44,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:47:44,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1073589017, now seen corresponding path program 1 times [2024-10-11 20:47:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187003890] [2024-10-11 20:47:44,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187003890] [2024-10-11 20:47:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187003890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:44,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858008114] [2024-10-11 20:47:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:44,838 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:44,916 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 20:47:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:44,919 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:44,919 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 20:47:44,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:44,920 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:44,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 20:47:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 20:47:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 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-10-11 20:47:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2024-10-11 20:47:44,930 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 39 [2024-10-11 20:47:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:44,930 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2024-10-11 20:47:44,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2024-10-11 20:47:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:47:44,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:44,931 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:47:44,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1078478761, now seen corresponding path program 1 times [2024-10-11 20:47:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041779118] [2024-10-11 20:47:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453540360] [2024-10-11 20:47:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:44,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:44,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:44,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:44,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:47:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:44,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:47:44,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:45,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041779118] [2024-10-11 20:47:45,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453540360] [2024-10-11 20:47:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453540360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113606438] [2024-10-11 20:47:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:45,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:45,009 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:45,063 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2024-10-11 20:47:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 20:47:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:45,065 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:47:45,065 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:45,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:45,066 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2024-10-11 20:47:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 106 states have internal predecessors, (108), 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-10-11 20:47:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:45,073 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 40 [2024-10-11 20:47:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:45,074 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:47:45,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:45,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:45,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:45,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:47:45,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 926896859, now seen corresponding path program 1 times [2024-10-11 20:47:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732446210] [2024-10-11 20:47:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:47:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732446210] [2024-10-11 20:47:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732446210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402107008] [2024-10-11 20:47:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:45,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:45,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:45,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:45,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:47:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:45,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:47:45,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:45,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402107008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:46,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-11 20:47:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038096510] [2024-10-11 20:47:46,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:46,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:47:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:47:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:47:46,006 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:46,763 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2024-10-11 20:47:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:47:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2024-10-11 20:47:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:46,765 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:47:46,765 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:46,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:47:46,766 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 292 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:46,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 548 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 300 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:47:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2024-10-11 20:47:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 107 states have internal predecessors, (109), 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-10-11 20:47:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2024-10-11 20:47:46,772 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 41 [2024-10-11 20:47:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2024-10-11 20:47:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2024-10-11 20:47:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:47:46,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:46,773 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:46,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:47:46,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:47:46,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:46,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1689653917, now seen corresponding path program 1 times [2024-10-11 20:47:46,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:46,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938455431] [2024-10-11 20:47:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121762306] [2024-10-11 20:47:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:46,991 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:46,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:47:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:47,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:47:47,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:47,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938455431] [2024-10-11 20:47:47,337 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121762306] [2024-10-11 20:47:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121762306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:47,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 20:47:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263278711] [2024-10-11 20:47:47,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:47,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:47:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:47:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:47:47,341 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:47:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:48,062 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2024-10-11 20:47:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:47:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-10-11 20:47:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:48,066 INFO L225 Difference]: With dead ends: 191 [2024-10-11 20:47:48,066 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 20:47:48,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:47:48,067 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:48,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 314 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:47:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 20:47:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 158. [2024-10-11 20:47:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 149 states have internal predecessors, (178), 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-10-11 20:47:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2024-10-11 20:47:48,077 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 43 [2024-10-11 20:47:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:48,077 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2024-10-11 20:47:48,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:47:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2024-10-11 20:47:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:47:48,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:48,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:48,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:48,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:47:48,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:48,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash 259779167, now seen corresponding path program 1 times [2024-10-11 20:47:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:48,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295968323] [2024-10-11 20:47:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017082028] [2024-10-11 20:47:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:48,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:48,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:47:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:47:48,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:48,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295968323] [2024-10-11 20:47:48,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017082028] [2024-10-11 20:47:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017082028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:48,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:48,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:48,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213255621] [2024-10-11 20:47:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:48,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:48,368 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:48,469 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-10-11 20:47:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-11 20:47:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:48,471 INFO L225 Difference]: With dead ends: 272 [2024-10-11 20:47:48,471 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 20:47:48,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:48,473 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:48,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 131 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 20:47:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2024-10-11 20:47:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 198 states have (on average 1.393939393939394) internal successors, (276), 224 states have internal predecessors, (276), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2024-10-11 20:47:48,487 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 45 [2024-10-11 20:47:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:48,488 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2024-10-11 20:47:48,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2024-10-11 20:47:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:47:48,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:48,489 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:48,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:47:48,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:48,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:48,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1625504061, now seen corresponding path program 1 times [2024-10-11 20:47:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449273677] [2024-10-11 20:47:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449273677] [2024-10-11 20:47:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449273677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355868715] [2024-10-11 20:47:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:48,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:48,814 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:48,934 INFO L93 Difference]: Finished difference Result 235 states and 292 transitions. [2024-10-11 20:47:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 20:47:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:48,936 INFO L225 Difference]: With dead ends: 235 [2024-10-11 20:47:48,936 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 20:47:48,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:47:48,937 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 101 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:48,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 173 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 20:47:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-11 20:47:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 223 states have internal predecessors, (272), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2024-10-11 20:47:48,948 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 63 [2024-10-11 20:47:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2024-10-11 20:47:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2024-10-11 20:47:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:47:48,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:48,949 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:48,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:47:48,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:48,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1625503741, now seen corresponding path program 1 times [2024-10-11 20:47:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75295836] [2024-10-11 20:47:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75295836] [2024-10-11 20:47:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75295836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741714888] [2024-10-11 20:47:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:49,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:49,020 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:49,144 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2024-10-11 20:47:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 20:47:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:49,146 INFO L225 Difference]: With dead ends: 242 [2024-10-11 20:47:49,146 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 20:47:49,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:49,147 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 30 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:49,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 20:47:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2024-10-11 20:47:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 198 states have (on average 1.3636363636363635) internal successors, (270), 223 states have internal predecessors, (270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 286 transitions. [2024-10-11 20:47:49,162 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 286 transitions. Word has length 63 [2024-10-11 20:47:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:49,163 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 286 transitions. [2024-10-11 20:47:49,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 286 transitions. [2024-10-11 20:47:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:47:49,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:49,164 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:47:49,164 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:49,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1148981528, now seen corresponding path program 1 times [2024-10-11 20:47:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853314103] [2024-10-11 20:47:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853314103] [2024-10-11 20:47:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853314103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805289482] [2024-10-11 20:47:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:49,235 INFO L87 Difference]: Start difference. First operand 234 states and 286 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:49,359 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2024-10-11 20:47:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:49,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-10-11 20:47:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:49,361 INFO L225 Difference]: With dead ends: 245 [2024-10-11 20:47:49,361 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 20:47:49,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:49,363 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:49,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 20:47:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 233. [2024-10-11 20:47:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3434343434343434) internal successors, (266), 222 states have internal predecessors, (266), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 282 transitions. [2024-10-11 20:47:49,375 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 282 transitions. Word has length 64 [2024-10-11 20:47:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 282 transitions. [2024-10-11 20:47:49,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 282 transitions. [2024-10-11 20:47:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:47:49,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:49,377 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:49,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:47:49,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1148991458, now seen corresponding path program 1 times [2024-10-11 20:47:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277586768] [2024-10-11 20:47:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277586768] [2024-10-11 20:47:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277586768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:49,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012078772] [2024-10-11 20:47:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:49,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:49,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:49,473 INFO L87 Difference]: Start difference. First operand 233 states and 282 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:49,669 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2024-10-11 20:47:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-10-11 20:47:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:49,671 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:47:49,671 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 20:47:49,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-10-11 20:47:49,672 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 118 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:49,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 164 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:47:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 20:47:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-11 20:47:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 222 states have internal predecessors, (264), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2024-10-11 20:47:49,684 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 64 [2024-10-11 20:47:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:49,684 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2024-10-11 20:47:49,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2024-10-11 20:47:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:47:49,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:49,685 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-10-11 20:47:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:47:49,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1759618188, now seen corresponding path program 1 times [2024-10-11 20:47:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440241776] [2024-10-11 20:47:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440241776] [2024-10-11 20:47:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440241776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783309223] [2024-10-11 20:47:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:49,751 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:49,876 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2024-10-11 20:47:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:49,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-10-11 20:47:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:49,877 INFO L225 Difference]: With dead ends: 238 [2024-10-11 20:47:49,878 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 20:47:49,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:49,878 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:49,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 221 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 20:47:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-11 20:47:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.315) internal successors, (263), 224 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-10-11 20:47:49,890 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 68 [2024-10-11 20:47:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:49,890 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-10-11 20:47:49,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-10-11 20:47:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:47:49,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:49,891 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-10-11 20:47:49,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:47:49,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:49,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1178681730, now seen corresponding path program 1 times [2024-10-11 20:47:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143148917] [2024-10-11 20:47:49,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:49,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143148917] [2024-10-11 20:47:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143148917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952668171] [2024-10-11 20:47:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:49,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:49,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:47:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:50,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:47:50,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:50,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952668171] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:50,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-10-11 20:47:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935437409] [2024-10-11 20:47:50,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:50,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:47:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:50,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:47:50,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:47:50,322 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:50,826 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2024-10-11 20:47:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:47:50,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 68 [2024-10-11 20:47:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:50,828 INFO L225 Difference]: With dead ends: 301 [2024-10-11 20:47:50,828 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 20:47:50,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:47:50,829 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 372 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:50,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 246 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 20:47:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2024-10-11 20:47:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 206 states have (on average 1.3058252427184467) internal successors, (269), 229 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 285 transitions. [2024-10-11 20:47:50,843 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 285 transitions. Word has length 68 [2024-10-11 20:47:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:50,843 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 285 transitions. [2024-10-11 20:47:50,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 285 transitions. [2024-10-11 20:47:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:47:50,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:50,844 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:50,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:51,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:47:51,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:51,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1286410942, now seen corresponding path program 1 times [2024-10-11 20:47:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523501379] [2024-10-11 20:47:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523501379] [2024-10-11 20:47:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523501379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568503138] [2024-10-11 20:47:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:51,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:51,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:47:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:51,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:51,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:51,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568503138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:51,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 20:47:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094561625] [2024-10-11 20:47:51,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:51,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:47:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:47:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:47:51,505 INFO L87 Difference]: Start difference. First operand 240 states and 285 transitions. Second operand has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:51,953 INFO L93 Difference]: Finished difference Result 274 states and 325 transitions. [2024-10-11 20:47:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:47:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 69 [2024-10-11 20:47:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:51,955 INFO L225 Difference]: With dead ends: 274 [2024-10-11 20:47:51,955 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 20:47:51,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:47:51,956 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 191 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:51,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 260 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 20:47:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2024-10-11 20:47:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 234 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:47:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 285 transitions. [2024-10-11 20:47:51,969 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 285 transitions. Word has length 69 [2024-10-11 20:47:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:51,970 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 285 transitions. [2024-10-11 20:47:51,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 285 transitions. [2024-10-11 20:47:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:47:51,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:51,971 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:51,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:47:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:52,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2115571956, now seen corresponding path program 1 times [2024-10-11 20:47:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884285727] [2024-10-11 20:47:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884285727] [2024-10-11 20:47:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884285727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588927676] [2024-10-11 20:47:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:52,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:47:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:52,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:47:52,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:59,552 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_52| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_52| |v_ULTIMATE.start_main_~R~0#1_52|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-10-11 20:47:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2024-10-11 20:47:59,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:48:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:48:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588927676] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:48:00,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:48:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 20:48:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857516916] [2024-10-11 20:48:00,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:48:00,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:48:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:48:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:48:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=5, NotChecked=22, Total=182 [2024-10-11 20:48:00,691 INFO L87 Difference]: Start difference. First operand 245 states and 285 transitions. Second operand has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 20:48:05,898 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-10-11 20:48:21,939 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-10-11 20:48:25,945 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-10-11 20:48:26,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:28,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:33,971 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-10-11 20:48:35,044 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-10-11 20:48:39,052 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-10-11 20:48:47,204 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-10-11 20:48:49,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:48:53,267 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-10-11 20:48:57,280 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-10-11 20:48:58,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:49:03,368 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-10-11 20:49:07,380 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-10-11 20:49:13,354 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-10-11 20:49:17,372 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-10-11 20:49:20,434 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]