./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/sqrt1-ll_unwindbound10.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/sqrt1-ll_unwindbound10.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 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:11:03,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:11:03,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:11:03,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:11:03,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:11:03,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:11:03,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:11:03,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:11:03,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:11:03,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:11:03,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:11:03,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:11:03,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:11:03,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:11:03,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:11:03,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:11:03,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:11:03,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:11:03,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:11:03,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:11:03,448 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:11:03,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:11:03,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:11:03,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:11:03,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:11:03,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:11:03,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:11:03,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:11:03,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:11:03,453 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 -> 4615816b63186e8ef25ffa56a09fb574b90534edb7a787dbb36e36eb2c34dee2 [2024-10-11 21:11:03,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:11:03,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:11:03,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:11:03,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:11:03,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:11:03,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-10-11 21:11:04,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:11:05,001 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:11:05,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2024-10-11 21:11:05,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01085b145/dcd2a16a375e4289b26ee8f628117ee8/FLAG3eb819b48 [2024-10-11 21:11:05,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01085b145/dcd2a16a375e4289b26ee8f628117ee8 [2024-10-11 21:11:05,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:11:05,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:11:05,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:11:05,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:11:05,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:11:05,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4299d618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05, skipping insertion in model container [2024-10-11 21:11:05,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:11:05,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:11:05,628 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:11:05,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:11:05,656 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:11:05,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05 WrapperNode [2024-10-11 21:11:05,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:11:05,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:11:05,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:11:05,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:11:05,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,687 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-10-11 21:11:05,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:11:05,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:11:05,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:11:05,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:11:05,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,704 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 21:11:05,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:11:05,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:11:05,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:11:05,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:11:05,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (1/1) ... [2024-10-11 21:11:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:11:05,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:05,739 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 21:11:05,741 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 21:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:11:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:11:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:11:05,827 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:11:05,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:11:06,126 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 21:11:06,127 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:11:06,159 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:11:06,160 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:11:06,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:06 BoogieIcfgContainer [2024-10-11 21:11:06,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:11:06,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:11:06,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:11:06,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:11:06,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:11:05" (1/3) ... [2024-10-11 21:11:06,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:06, skipping insertion in model container [2024-10-11 21:11:06,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:05" (2/3) ... [2024-10-11 21:11:06,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:06, skipping insertion in model container [2024-10-11 21:11:06,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:06" (3/3) ... [2024-10-11 21:11:06,169 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2024-10-11 21:11:06,182 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:11:06,183 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-10-11 21:11:06,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:11:06,240 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;@4da73708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:11:06,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 21:11:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 112 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:11:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 21:11:06,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:06,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 21:11:06,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 187138, now seen corresponding path program 1 times [2024-10-11 21:11:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:06,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120273068] [2024-10-11 21:11:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120273068] [2024-10-11 21:11:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120273068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:06,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:06,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501798711] [2024-10-11 21:11:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:11:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:11:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:11:06,362 INFO L87 Difference]: Start difference. First operand has 120 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 112 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:06,385 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2024-10-11 21:11:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:11:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 21:11:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:06,394 INFO L225 Difference]: With dead ends: 235 [2024-10-11 21:11:06,395 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 21:11:06,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:11:06,401 INFO L432 NwaCegarLoop]: 120 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, 120 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 21:11:06,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 21:11:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 21:11:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:11:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2024-10-11 21:11:06,443 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 3 [2024-10-11 21:11:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:06,443 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2024-10-11 21:11:06,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2024-10-11 21:11:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 21:11:06,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:06,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 21:11:06,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:11:06,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:06,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash 184737, now seen corresponding path program 1 times [2024-10-11 21:11:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:06,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476810792] [2024-10-11 21:11:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:06,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:06,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476810792] [2024-10-11 21:11:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476810792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347867989] [2024-10-11 21:11:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:06,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:06,550 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:06,601 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2024-10-11 21:11:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:11:06,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 21:11:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:06,605 INFO L225 Difference]: With dead ends: 167 [2024-10-11 21:11:06,606 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 21:11:06,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:11:06,607 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:06,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 21:11:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 21:11:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:11:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-10-11 21:11:06,617 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 3 [2024-10-11 21:11:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:06,617 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-10-11 21:11:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-10-11 21:11:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:11:06,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:06,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:11:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:11:06,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1208573546, now seen corresponding path program 1 times [2024-10-11 21:11:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159248467] [2024-10-11 21:11:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:06,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159248467] [2024-10-11 21:11:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159248467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 21:11:06,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071383692] [2024-10-11 21:11:06,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:06,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:06,651 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:06,758 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2024-10-11 21:11:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 21:11:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:06,760 INFO L225 Difference]: With dead ends: 211 [2024-10-11 21:11:06,760 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 21:11:06,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:06,761 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:06,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 21:11:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2024-10-11 21:11:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 145 states have internal predecessors, (159), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:11:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2024-10-11 21:11:06,773 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 6 [2024-10-11 21:11:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:06,773 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2024-10-11 21:11:06,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2024-10-11 21:11:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:11:06,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:06,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:11:06,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1948900906, now seen corresponding path program 1 times [2024-10-11 21:11:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014981133] [2024-10-11 21:11:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838285231] [2024-10-11 21:11:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:06,812 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 21:11:06,814 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 21:11:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:06,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:06,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:06,934 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 21:11:06,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014981133] [2024-10-11 21:11:06,935 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838285231] [2024-10-11 21:11:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838285231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198257245] [2024-10-11 21:11:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:06,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:06,938 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:07,053 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2024-10-11 21:11:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-11 21:11:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:07,055 INFO L225 Difference]: With dead ends: 183 [2024-10-11 21:11:07,055 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 21:11:07,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:07,056 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:07,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 176 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 21:11:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-10-11 21:11:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 155 states have internal predecessors, (170), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2024-10-11 21:11:07,072 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 27 [2024-10-11 21:11:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:07,073 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2024-10-11 21:11:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2024-10-11 21:11:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 21:11:07,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:07,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:07,089 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 21:11:07,278 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 21:11:07,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 286386016, now seen corresponding path program 1 times [2024-10-11 21:11:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177036376] [2024-10-11 21:11:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,379 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 21:11:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177036376] [2024-10-11 21:11:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177036376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137223742] [2024-10-11 21:11:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:07,381 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:07,456 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2024-10-11 21:11:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 21:11:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:07,458 INFO L225 Difference]: With dead ends: 183 [2024-10-11 21:11:07,458 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 21:11:07,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:11:07,459 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 170 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 21:11:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-10-11 21:11:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 111 states have (on average 1.4954954954954955) internal successors, (166), 158 states have internal predecessors, (166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-10-11 21:11:07,469 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 28 [2024-10-11 21:11:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:07,470 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-10-11 21:11:07,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-10-11 21:11:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 21:11:07,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:07,471 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:07,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:11:07,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:07,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:07,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1920828334, now seen corresponding path program 1 times [2024-10-11 21:11:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291762290] [2024-10-11 21:11:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,538 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 21:11:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291762290] [2024-10-11 21:11:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291762290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48708793] [2024-10-11 21:11:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:07,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:07,541 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:07,622 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2024-10-11 21:11:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 21:11:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:07,624 INFO L225 Difference]: With dead ends: 175 [2024-10-11 21:11:07,624 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 21:11:07,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:11:07,625 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:07,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 185 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 21:11:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-10-11 21:11:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 158 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2024-10-11 21:11:07,631 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 31 [2024-10-11 21:11:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:07,632 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2024-10-11 21:11:07,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2024-10-11 21:11:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 21:11:07,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:07,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:07,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:11:07,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:07,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash 733907250, now seen corresponding path program 1 times [2024-10-11 21:11:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78998007] [2024-10-11 21:11:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,743 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 21:11:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:07,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78998007] [2024-10-11 21:11:07,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78998007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:07,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:07,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217595027] [2024-10-11 21:11:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:07,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:07,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:07,745 INFO L87 Difference]: Start difference. First operand 170 states and 184 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:07,830 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2024-10-11 21:11:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:07,831 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-10-11 21:11:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:07,832 INFO L225 Difference]: With dead ends: 175 [2024-10-11 21:11:07,832 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 21:11:07,833 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 21:11:07,833 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:07,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 161 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 21:11:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 21:11:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 137 states have internal predecessors, (139), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2024-10-11 21:11:07,839 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 35 [2024-10-11 21:11:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:07,840 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2024-10-11 21:11:07,840 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2024-10-11 21:11:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 21:11:07,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:07,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:07,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:11:07,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -132779018, now seen corresponding path program 1 times [2024-10-11 21:11:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775080205] [2024-10-11 21:11:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775080205] [2024-10-11 21:11:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775080205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955299584] [2024-10-11 21:11:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:07,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:07,955 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:08,046 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2024-10-11 21:11:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-11 21:11:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:08,048 INFO L225 Difference]: With dead ends: 150 [2024-10-11 21:11:08,049 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 21:11:08,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 21:11:08,050 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:08,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 21:11:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-10-11 21:11:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-10-11 21:11:08,060 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 48 [2024-10-11 21:11:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:08,060 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-10-11 21:11:08,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-10-11 21:11:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:11:08,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:08,061 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:08,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:11:08,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:08,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 178817848, now seen corresponding path program 1 times [2024-10-11 21:11:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291257216] [2024-10-11 21:11:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291257216] [2024-10-11 21:11:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291257216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868471979] [2024-10-11 21:11:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:08,164 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:08,230 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2024-10-11 21:11:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:08,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-10-11 21:11:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:08,232 INFO L225 Difference]: With dead ends: 150 [2024-10-11 21:11:08,233 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 21:11:08,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 21:11:08,234 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:08,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 21:11:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-11 21:11:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2024-10-11 21:11:08,238 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 49 [2024-10-11 21:11:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:08,238 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2024-10-11 21:11:08,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2024-10-11 21:11:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 21:11:08,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:08,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:08,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:11:08,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:08,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 45261274, now seen corresponding path program 1 times [2024-10-11 21:11:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978642244] [2024-10-11 21:11:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978642244] [2024-10-11 21:11:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978642244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:08,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26121529] [2024-10-11 21:11:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:08,332 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 21:11:08,333 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 21:11:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:11:08,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:08,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26121529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:11:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686217269] [2024-10-11 21:11:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:08,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:11:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:11:08,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:08,499 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:08,518 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2024-10-11 21:11:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:08,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-11 21:11:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:08,521 INFO L225 Difference]: With dead ends: 149 [2024-10-11 21:11:08,521 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 21:11:08,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:11:08,522 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:08,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 220 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 21:11:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-11 21:11:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-10-11 21:11:08,528 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 51 [2024-10-11 21:11:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:08,528 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-10-11 21:11:08,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-10-11 21:11:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 21:11:08,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:08,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:08,544 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 21:11:08,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:08,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1403099535, now seen corresponding path program 1 times [2024-10-11 21:11:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323549929] [2024-10-11 21:11:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323549929] [2024-10-11 21:11:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323549929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743715272] [2024-10-11 21:11:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:08,825 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 21:11:08,826 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 21:11:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:08,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:11:08,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:08,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743715272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:08,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:08,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:11:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725115143] [2024-10-11 21:11:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:11:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:11:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:08,962 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:09,003 INFO L93 Difference]: Finished difference Result 196 states and 204 transitions. [2024-10-11 21:11:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:11:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-11 21:11:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:09,004 INFO L225 Difference]: With dead ends: 196 [2024-10-11 21:11:09,005 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 21:11:09,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:09,005 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 76 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:09,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 503 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 21:11:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2024-10-11 21:11:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.5333333333333334) internal successors, (161), 151 states have internal predecessors, (161), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2024-10-11 21:11:09,015 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 52 [2024-10-11 21:11:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:09,015 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2024-10-11 21:11:09,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2024-10-11 21:11:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:11:09,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:09,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:09,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:09,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -241076335, now seen corresponding path program 1 times [2024-10-11 21:11:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729062603] [2024-10-11 21:11:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729062603] [2024-10-11 21:11:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729062603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666505151] [2024-10-11 21:11:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:09,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:09,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:09,263 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 21:11:09,264 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 21:11:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:09,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:09,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666505151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:11:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540309835] [2024-10-11 21:11:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:11:09,376 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:09,440 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-10-11 21:11:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:09,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-10-11 21:11:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:09,442 INFO L225 Difference]: With dead ends: 163 [2024-10-11 21:11:09,442 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 21:11:09,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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 21:11:09,443 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:09,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 21:11:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-10-11 21:11:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 142 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-10-11 21:11:09,449 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 54 [2024-10-11 21:11:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:09,449 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-10-11 21:11:09,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-10-11 21:11:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 21:11:09,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:09,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:09,462 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 21:11:09,651 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,SelfDestructingSolverStorable11 [2024-10-11 21:11:09,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:09,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1116568257, now seen corresponding path program 1 times [2024-10-11 21:11:09,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:09,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167383743] [2024-10-11 21:11:09,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167383743] [2024-10-11 21:11:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167383743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017914050] [2024-10-11 21:11:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:09,690 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 21:11:09,691 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 21:11:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:09,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:09,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:09,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017914050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:09,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 21:11:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324886342] [2024-10-11 21:11:09,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:09,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:11:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:11:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:09,846 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 21:11:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:09,994 INFO L93 Difference]: Finished difference Result 278 states and 329 transitions. [2024-10-11 21:11:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:09,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2024-10-11 21:11:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:09,996 INFO L225 Difference]: With dead ends: 278 [2024-10-11 21:11:09,996 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 21:11:09,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:09,997 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 284 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:09,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 270 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 21:11:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 145. [2024-10-11 21:11:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 133 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2024-10-11 21:11:10,003 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 55 [2024-10-11 21:11:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2024-10-11 21:11:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 21:11:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2024-10-11 21:11:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:11:10,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:10,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:10,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:10,208 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,SelfDestructingSolverStorable12 [2024-10-11 21:11:10,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -630108129, now seen corresponding path program 1 times [2024-10-11 21:11:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000812507] [2024-10-11 21:11:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647434174] [2024-10-11 21:11:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:10,222 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 21:11:10,223 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 21:11:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:10,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:10,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 21:11:10,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 21:11:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000812507] [2024-10-11 21:11:10,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647434174] [2024-10-11 21:11:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647434174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:10,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 21:11:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594015176] [2024-10-11 21:11:10,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:10,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:11:10,434 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:11:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:10,575 INFO L93 Difference]: Finished difference Result 369 states and 404 transitions. [2024-10-11 21:11:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2024-10-11 21:11:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:10,577 INFO L225 Difference]: With dead ends: 369 [2024-10-11 21:11:10,577 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 21:11:10,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:10,578 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 286 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 315 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 21:11:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 243. [2024-10-11 21:11:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 195 states have (on average 1.3282051282051281) internal successors, (259), 223 states have internal predecessors, (259), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:11:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 295 transitions. [2024-10-11 21:11:10,588 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 295 transitions. Word has length 68 [2024-10-11 21:11:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:10,588 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 295 transitions. [2024-10-11 21:11:10,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:11:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 295 transitions. [2024-10-11 21:11:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:11:10,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:10,589 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:10,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:11:10,790 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,SelfDestructingSolverStorable13 [2024-10-11 21:11:10,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -953494685, now seen corresponding path program 1 times [2024-10-11 21:11:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047527664] [2024-10-11 21:11:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:10,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063096765] [2024-10-11 21:11:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:10,802 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 21:11:10,803 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 21:11:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:10,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:10,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:10,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047527664] [2024-10-11 21:11:11,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063096765] [2024-10-11 21:11:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063096765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:11,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:11,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 21:11:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325308965] [2024-10-11 21:11:11,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:11,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:11,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:11:11,003 INFO L87 Difference]: Start difference. First operand 243 states and 295 transitions. Second operand has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 21:11:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:11,200 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2024-10-11 21:11:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:11,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2024-10-11 21:11:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:11,202 INFO L225 Difference]: With dead ends: 331 [2024-10-11 21:11:11,203 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 21:11:11,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:11,205 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 197 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:11,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 245 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 21:11:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2024-10-11 21:11:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.2412060301507537) internal successors, (247), 221 states have internal predecessors, (247), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:11:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2024-10-11 21:11:11,221 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 75 [2024-10-11 21:11:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:11,221 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2024-10-11 21:11:11,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 21:11:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2024-10-11 21:11:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:11:11,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:11,225 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:11,237 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 21:11:11,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:11,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 506435911, now seen corresponding path program 1 times [2024-10-11 21:11:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927173622] [2024-10-11 21:11:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927173622] [2024-10-11 21:11:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927173622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198888802] [2024-10-11 21:11:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:11,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:11,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:11,515 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 21:11:11,516 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 21:11:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:11,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:11,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:11,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198888802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:11,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 21:11:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084579715] [2024-10-11 21:11:11,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:11,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:11:11,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:11:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:11,761 INFO L87 Difference]: Start difference. First operand 243 states and 287 transitions. Second operand has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:11,918 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2024-10-11 21:11:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 76 [2024-10-11 21:11:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:11,920 INFO L225 Difference]: With dead ends: 243 [2024-10-11 21:11:11,920 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 21:11:11,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:11:11,920 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 148 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:11,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 214 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 21:11:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-11 21:11:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 218 states have internal predecessors, (240), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:11:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2024-10-11 21:11:11,930 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 76 [2024-10-11 21:11:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2024-10-11 21:11:11,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2024-10-11 21:11:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 21:11:11,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:11,931 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:11,943 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 21:11:12,131 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,SelfDestructingSolverStorable15 [2024-10-11 21:11:12,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1480355867, now seen corresponding path program 1 times [2024-10-11 21:11:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630954599] [2024-10-11 21:11:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630954599] [2024-10-11 21:11:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630954599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981462536] [2024-10-11 21:11:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:12,218 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 21:11:12,219 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 21:11:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:12,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:12,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981462536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:12,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 21:11:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142191781] [2024-10-11 21:11:12,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:11:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:11:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:12,451 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:12,631 INFO L93 Difference]: Finished difference Result 295 states and 345 transitions. [2024-10-11 21:11:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:11:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2024-10-11 21:11:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:12,633 INFO L225 Difference]: With dead ends: 295 [2024-10-11 21:11:12,633 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 21:11:12,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:12,634 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 160 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:12,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 239 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 21:11:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 250. [2024-10-11 21:11:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 213 states have (on average 1.1220657276995305) internal successors, (239), 226 states have internal predecessors, (239), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 21:11:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2024-10-11 21:11:12,646 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 77 [2024-10-11 21:11:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:12,646 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2024-10-11 21:11:12,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2024-10-11 21:11:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 21:11:12,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:12,647 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:12,659 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 21:11:12,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:11:12,852 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -987810713, now seen corresponding path program 1 times [2024-10-11 21:11:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125997284] [2024-10-11 21:11:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125997284] [2024-10-11 21:11:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125997284] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134381967] [2024-10-11 21:11:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:12,942 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 21:11:12,943 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 21:11:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:12,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:11:12,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:13,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:13,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134381967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:13,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:13,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:11:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398157901] [2024-10-11 21:11:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:13,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:13,172 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 21:11:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:13,269 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2024-10-11 21:11:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:13,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 79 [2024-10-11 21:11:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:13,270 INFO L225 Difference]: With dead ends: 252 [2024-10-11 21:11:13,270 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 21:11:13,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:13,272 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 74 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:13,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 21:11:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-10-11 21:11:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.0497237569060773) internal successors, (190), 187 states have internal predecessors, (190), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:11:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2024-10-11 21:11:13,281 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 79 [2024-10-11 21:11:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:13,282 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2024-10-11 21:11:13,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 21:11:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2024-10-11 21:11:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 21:11:13,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:13,284 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2024-10-11 21:11:13,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 21:11:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:11:13,484 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:13,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1800995286, now seen corresponding path program 1 times [2024-10-11 21:11:13,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:13,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288927320] [2024-10-11 21:11:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:13,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288927320] [2024-10-11 21:11:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288927320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440937251] [2024-10-11 21:11:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:13,621 INFO L229 MonitoredProcess]: Starting monitored process 12 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 21:11:13,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:11:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:13,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:11:13,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:13,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440937251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:14,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-11 21:11:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516845606] [2024-10-11 21:11:14,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 21:11:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:14,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 21:11:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:11:14,149 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 21:11:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:14,407 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2024-10-11 21:11:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:11:14,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 145 [2024-10-11 21:11:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:14,408 INFO L225 Difference]: With dead ends: 337 [2024-10-11 21:11:14,409 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 21:11:14,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-10-11 21:11:14,409 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 183 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:14,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 273 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 21:11:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 298. [2024-10-11 21:11:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 264 states have (on average 1.0643939393939394) internal successors, (281), 270 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 21:11:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 331 transitions. [2024-10-11 21:11:14,423 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 331 transitions. Word has length 145 [2024-10-11 21:11:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:14,424 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 331 transitions. [2024-10-11 21:11:14,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 21:11:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 331 transitions. [2024-10-11 21:11:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 21:11:14,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:14,426 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-10-11 21:11:14,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 21:11:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:14,629 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 168362967, now seen corresponding path program 2 times [2024-10-11 21:11:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:14,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345194928] [2024-10-11 21:11:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345194928] [2024-10-11 21:11:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345194928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513807879] [2024-10-11 21:11:14,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:14,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:14,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:14,824 INFO L229 MonitoredProcess]: Starting monitored process 13 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 21:11:14,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 21:11:14,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:14,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:14,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:11:14,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:15,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513807879] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:15,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-10-11 21:11:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413475608] [2024-10-11 21:11:15,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 21:11:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 21:11:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-10-11 21:11:15,412 INFO L87 Difference]: Start difference. First operand 298 states and 331 transitions. Second operand has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 21:11:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:15,740 INFO L93 Difference]: Finished difference Result 378 states and 419 transitions. [2024-10-11 21:11:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:11:15,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 173 [2024-10-11 21:11:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:15,744 INFO L225 Difference]: With dead ends: 378 [2024-10-11 21:11:15,744 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:11:15,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-10-11 21:11:15,745 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 223 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:15,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 454 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:11:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 318. [2024-10-11 21:11:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 282 states have (on average 1.0602836879432624) internal successors, (299), 288 states have internal predecessors, (299), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 21:11:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 353 transitions. [2024-10-11 21:11:15,759 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 353 transitions. Word has length 173 [2024-10-11 21:11:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 353 transitions. [2024-10-11 21:11:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 21:11:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 353 transitions. [2024-10-11 21:11:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 21:11:15,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:15,761 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 21:11:15,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 21:11:15,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:15,962 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:15,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2140295468, now seen corresponding path program 2 times [2024-10-11 21:11:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826004011] [2024-10-11 21:11:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679756373] [2024-10-11 21:11:15,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:15,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:15,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:15,997 INFO L229 MonitoredProcess]: Starting monitored process 14 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 21:11:15,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 21:11:16,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:16,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:16,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:11:16,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 21:11:16,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 21:11:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826004011] [2024-10-11 21:11:16,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679756373] [2024-10-11 21:11:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679756373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:16,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 21:11:16,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827686541] [2024-10-11 21:11:16,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:16,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:11:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:11:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:16,494 INFO L87 Difference]: Start difference. First operand 318 states and 353 transitions. Second operand has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 21:11:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:16,930 INFO L93 Difference]: Finished difference Result 511 states and 564 transitions. [2024-10-11 21:11:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:11:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 212 [2024-10-11 21:11:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:16,933 INFO L225 Difference]: With dead ends: 511 [2024-10-11 21:11:16,933 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 21:11:16,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:11:16,933 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 433 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:16,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 805 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 21:11:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 432. [2024-10-11 21:11:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 387 states have (on average 1.0594315245478036) internal successors, (410), 393 states have internal predecessors, (410), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 482 transitions. [2024-10-11 21:11:16,950 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 482 transitions. Word has length 212 [2024-10-11 21:11:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:16,950 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 482 transitions. [2024-10-11 21:11:16,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 21:11:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 482 transitions. [2024-10-11 21:11:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 21:11:16,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:16,952 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 21:11:16,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:17,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:17,156 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:17,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash -832737522, now seen corresponding path program 2 times [2024-10-11 21:11:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592651094] [2024-10-11 21:11:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:17,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934863659] [2024-10-11 21:11:17,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:17,178 INFO L229 MonitoredProcess]: Starting monitored process 15 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 21:11:17,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 21:11:17,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:17,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:17,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:11:17,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 21:11:17,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 21:11:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592651094] [2024-10-11 21:11:17,656 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934863659] [2024-10-11 21:11:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934863659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:17,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 21:11:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12347477] [2024-10-11 21:11:17,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:11:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:11:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:17,658 INFO L87 Difference]: Start difference. First operand 432 states and 482 transitions. Second operand has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 21:11:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:18,035 INFO L93 Difference]: Finished difference Result 504 states and 562 transitions. [2024-10-11 21:11:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:11:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 219 [2024-10-11 21:11:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:18,037 INFO L225 Difference]: With dead ends: 504 [2024-10-11 21:11:18,037 INFO L226 Difference]: Without dead ends: 460 [2024-10-11 21:11:18,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:11:18,039 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 308 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:18,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 906 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-11 21:11:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2024-10-11 21:11:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 379 states have (on average 1.0395778364116095) internal successors, (394), 385 states have internal predecessors, (394), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 466 transitions. [2024-10-11 21:11:18,054 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 466 transitions. Word has length 219 [2024-10-11 21:11:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:18,054 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 466 transitions. [2024-10-11 21:11:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 21:11:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 466 transitions. [2024-10-11 21:11:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-11 21:11:18,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:18,057 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2024-10-11 21:11:18,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 21:11:18,258 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -842441714, now seen corresponding path program 2 times [2024-10-11 21:11:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822514874] [2024-10-11 21:11:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 21:11:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822514874] [2024-10-11 21:11:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822514874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700939509] [2024-10-11 21:11:18,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:18,738 INFO L229 MonitoredProcess]: Starting monitored process 16 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 21:11:18,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 21:11:18,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:18,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:18,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:18,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-11 21:11:19,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-11 21:11:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700939509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:19,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2024-10-11 21:11:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660167490] [2024-10-11 21:11:19,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:19,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:11:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:11:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:11:19,376 INFO L87 Difference]: Start difference. First operand 424 states and 466 transitions. Second operand has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 21:11:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:20,471 INFO L93 Difference]: Finished difference Result 440 states and 484 transitions. [2024-10-11 21:11:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 21:11:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 337 [2024-10-11 21:11:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:20,474 INFO L225 Difference]: With dead ends: 440 [2024-10-11 21:11:20,474 INFO L226 Difference]: Without dead ends: 439 [2024-10-11 21:11:20,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=511, Invalid=2795, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 21:11:20,476 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 418 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:20,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1964 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:11:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-11 21:11:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 423. [2024-10-11 21:11:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 379 states have (on average 1.029023746701847) internal successors, (390), 384 states have internal predecessors, (390), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 462 transitions. [2024-10-11 21:11:20,494 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 462 transitions. Word has length 337 [2024-10-11 21:11:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:20,495 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 462 transitions. [2024-10-11 21:11:20,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 21:11:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 462 transitions. [2024-10-11 21:11:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-11 21:11:20,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:20,499 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1] [2024-10-11 21:11:20,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 21:11:20,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:20,703 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash -313171013, now seen corresponding path program 3 times [2024-10-11 21:11:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220539804] [2024-10-11 21:11:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 0 proven. 896 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 21:11:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220539804] [2024-10-11 21:11:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220539804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689913077] [2024-10-11 21:11:21,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:21,185 INFO L229 MonitoredProcess]: Starting monitored process 17 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 21:11:21,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 21:11:21,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:11:21,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:21,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 21:11:21,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-10-11 21:11:21,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689913077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:22,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:22,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 23 [2024-10-11 21:11:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822653049] [2024-10-11 21:11:22,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:11:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:11:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-10-11 21:11:22,125 INFO L87 Difference]: Start difference. First operand 423 states and 462 transitions. Second operand has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:11:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:24,999 INFO L93 Difference]: Finished difference Result 425 states and 464 transitions. [2024-10-11 21:11:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 21:11:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 365 [2024-10-11 21:11:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:25,001 INFO L225 Difference]: With dead ends: 425 [2024-10-11 21:11:25,001 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 21:11:25,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=964, Invalid=4586, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 21:11:25,003 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 551 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:25,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1274 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 21:11:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 21:11:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-11 21:11:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.010958904109589) internal successors, (369), 368 states have internal predecessors, (369), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 21:11:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 437 transitions. [2024-10-11 21:11:25,022 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 437 transitions. Word has length 365 [2024-10-11 21:11:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:25,023 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 437 transitions. [2024-10-11 21:11:25,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:11:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 437 transitions. [2024-10-11 21:11:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-10-11 21:11:25,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:25,025 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2024-10-11 21:11:25,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 21:11:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 21:11:25,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1293114942, now seen corresponding path program 3 times [2024-10-11 21:11:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723546185] [2024-10-11 21:11:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 21:11:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-10-11 21:11:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-10-11 21:11:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2024-10-11 21:11:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 21:11:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-11 21:11:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-11 21:11:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-11 21:11:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1721 proven. 49 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 21:11:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723546185] [2024-10-11 21:11:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723546185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028345803] [2024-10-11 21:11:25,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:25,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:25,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:25,904 INFO L229 MonitoredProcess]: Starting monitored process 18 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 21:11:25,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 21:11:25,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 21:11:25,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:25,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 21:11:25,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2024-10-11 21:11:26,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028345803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:26,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 31 [2024-10-11 21:11:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372234605] [2024-10-11 21:11:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:26,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:11:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:11:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2024-10-11 21:11:26,216 INFO L87 Difference]: Start difference. First operand 405 states and 437 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:26,535 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2024-10-11 21:11:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:11:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 500 [2024-10-11 21:11:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:26,538 INFO L225 Difference]: With dead ends: 407 [2024-10-11 21:11:26,538 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 21:11:26,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 21:11:26,539 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:26,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 77 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 21:11:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2024-10-11 21:11:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 365 states have (on average 1.0054794520547945) internal successors, (367), 366 states have internal predecessors, (367), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 21:11:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 435 transitions. [2024-10-11 21:11:26,567 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 435 transitions. Word has length 500 [2024-10-11 21:11:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:26,568 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 435 transitions. [2024-10-11 21:11:26,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 435 transitions. [2024-10-11 21:11:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-10-11 21:11:26,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:26,570 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2024-10-11 21:11:26,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:26,775 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1593930852, now seen corresponding path program 3 times [2024-10-11 21:11:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173395462] [2024-10-11 21:11:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 21:11:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-10-11 21:11:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-10-11 21:11:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2024-10-11 21:11:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 21:11:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-11 21:11:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-11 21:11:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-11 21:11:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-10-11 21:11:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1751 proven. 49 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 21:11:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173395462] [2024-10-11 21:11:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173395462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261329942] [2024-10-11 21:11:27,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:27,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:27,409 INFO L229 MonitoredProcess]: Starting monitored process 19 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 21:11:27,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 21:11:27,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:11:27,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:27,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 21:11:27,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 180 proven. 234 refuted. 0 times theorem prover too weak. 3370 trivial. 0 not checked. [2024-10-11 21:11:27,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:41,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261329942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:41,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 32 [2024-10-11 21:11:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209455851] [2024-10-11 21:11:41,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 21:11:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 21:11:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1294, Unknown=3, NotChecked=0, Total=1482 [2024-10-11 21:11:41,535 INFO L87 Difference]: Start difference. First operand 403 states and 435 transitions. Second operand has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2024-10-11 21:11:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:45,832 INFO L93 Difference]: Finished difference Result 485 states and 510 transitions. [2024-10-11 21:11:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-10-11 21:11:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) Word has length 507 [2024-10-11 21:11:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:45,833 INFO L225 Difference]: With dead ends: 485 [2024-10-11 21:11:45,833 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:11:45,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5887 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=2868, Invalid=16589, Unknown=3, NotChecked=0, Total=19460 [2024-10-11 21:11:45,837 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 230 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 3975 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:45,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 987 Invalid, 4038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3975 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 21:11:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:11:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:11:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:11:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:11:45,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 507 [2024-10-11 21:11:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:11:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2024-10-11 21:11:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:11:45,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:11:45,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2024-10-11 21:11:45,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2024-10-11 21:11:45,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2024-10-11 21:11:45,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2024-10-11 21:11:45,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2024-10-11 21:11:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2024-10-11 21:11:45,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2024-10-11 21:11:45,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2024-10-11 21:11:45,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:46,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 21:11:46,047 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:46,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:11:49,885 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:11:49,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:11:49 BoogieIcfgContainer [2024-10-11 21:11:49,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:11:49,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:11:49,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:11:49,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:11:49,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:06" (3/4) ... [2024-10-11 21:11:49,922 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:11:49,925 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:11:49,929 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 21:11:49,930 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:11:49,930 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:11:49,930 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:11:50,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:11:50,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:11:50,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:11:50,013 INFO L158 Benchmark]: Toolchain (without parser) took 44579.07ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 73.1MB in the beginning and 224.9MB in the end (delta: -151.7MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2024-10-11 21:11:50,013 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:11:50,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.57ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 110.4MB in the end (delta: -37.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:11:50,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.76ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:11:50,013 INFO L158 Benchmark]: Boogie Preprocessor took 23.18ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 107.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:11:50,014 INFO L158 Benchmark]: RCFGBuilder took 446.70ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 86.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 21:11:50,014 INFO L158 Benchmark]: TraceAbstraction took 43757.15ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 86.1MB in the beginning and 231.2MB in the end (delta: -145.1MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. [2024-10-11 21:11:50,014 INFO L158 Benchmark]: Witness Printer took 92.11ms. Allocated memory is still 394.3MB. Free memory was 231.2MB in the beginning and 224.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:11:50,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.57ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 110.4MB in the end (delta: -37.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.76ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.18ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 107.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 446.70ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 86.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43757.15ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 86.1MB in the beginning and 231.2MB in the end (delta: -145.1MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. * Witness Printer took 92.11ms. Allocated memory is still 394.3MB. Free memory was 231.2MB in the beginning and 224.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 39.8s, OverallIterations: 26, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4174 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4100 mSDsluCounter, 10754 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8275 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12365 IncrementalHoareTripleChecker+Invalid, 12954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 2479 mSDtfsCounter, 12365 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5228 GetRequests, 4772 SyntacticMatches, 0 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8626 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=21, InterpolantAutomatonStates: 344, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 653 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 6347 NumberOfCodeBlocks, 5148 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 7134 ConstructedInterpolants, 4 QuantifiedInterpolants, 27751 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3223 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 24236/28693 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((n <= 2147483647) && (counter <= 10)) && (9 <= counter)) && (3 <= t)) && (1 <= a)) && ((((__int128) a * a) + ((__int128) 2 * a)) <= 9223372036854775806)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) || ((((((n <= 2147483647) && (counter <= 10)) && (16 == s)) && (7 == t)) && (3 == a)) && (3 <= counter))) || ((((((n <= 2147483647) && (2 <= counter)) && (counter <= 10)) && (5 == t)) && (9 == s)) && (2 == a))) || ((((((((n <= 2147483647) && (counter <= 10)) && (3 <= t)) && (1 <= a)) && (8 <= counter)) && (s <= ((__int128) 2147483647 + t))) && ((((__int128) a * a) + ((__int128) a * 4)) <= 9223372036854775803)) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1)))) || (((((((((n <= 2147483647) && (counter <= 10)) && ((((long long) n * 4) + ((__int128) 2 * t)) <= ((__int128) 8589934574 + s))) && (3 <= t)) && (1 <= a)) && (5 <= counter)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) && ((((__int128) a * 10) + ((__int128) a * a)) <= 9223372036854775782))) || (((((((n <= 2147483647) && (counter == 10)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1)))) || ((((((n <= 2147483647) && (counter <= 10)) && (s == 25)) && (9 == t)) && (4 <= counter)) && (a == 4))) || (((((((((n <= 2147483647) && (counter <= 10)) && (6 <= counter)) && (3 <= t)) && (1 <= a)) && ((((__int128) a * 8) + ((__int128) a * a)) <= 9223372036854775791)) && ((((__int128) 3 * t) + ((long long) n * 4)) <= ((__int128) 8589934578 + s))) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1)))) || ((((((n <= 2147483647) && (counter <= 10)) && (3 == t)) && (a == 1)) && (1 <= counter)) && (s == 4))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) || ((((((((n <= 2147483647) && (counter <= 10)) && (3 <= t)) && (1 <= a)) && (7 <= counter)) && ((((__int128) a * a) + ((__int128) 6 * a)) <= 9223372036854775798)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1)))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: ((cond != 0) || ((counter + 2147483648) < 0)) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:11:50,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE