/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:25:07,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:25:07,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:25:07,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:25:07,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:25:07,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:25:07,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:25:07,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:25:07,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:25:07,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:25:07,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:25:07,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:25:07,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:25:07,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:25:07,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:25:07,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:25:07,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:25:07,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:25:07,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:25:07,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:25:07,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:25:07,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:25:07,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:25:07,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:25:07,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:25:07,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:25:07,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:25:07,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:25:07,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:25:07,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:25:07,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:25:07,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:25:07,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:25:07,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:25:07,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:25:07,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:25:07,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:25:07,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:25:07,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:25:07,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:25:07,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:25:07,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 14:25:07,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:25:07,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:25:07,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:25:07,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:25:07,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:25:07,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:25:07,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:25:07,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:25:07,268 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:25:07,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:25:07,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:25:07,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:25:07,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:25:07,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:25:07,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:25:07,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:25:07,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:25:07,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:25:07,271 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:25:07,271 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:25:07,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:25:07,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:25:07,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:25:07,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:25:07,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:25:07,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:25:07,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:25:07,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:25:07,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:25:07,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:25:07,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:25:07,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:25:07,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:25:07,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 14:25:07,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:25:07,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:25:07,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:25:07,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:25:07,718 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:25:07,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-10-16 14:25:07,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d939a70/3df51b3454c149f795fb2a74b8bb7982/FLAG1d1938df8 [2022-10-16 14:25:08,518 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:25:08,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-10-16 14:25:08,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d939a70/3df51b3454c149f795fb2a74b8bb7982/FLAG1d1938df8 [2022-10-16 14:25:08,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d939a70/3df51b3454c149f795fb2a74b8bb7982 [2022-10-16 14:25:08,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:25:08,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:25:08,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:25:08,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:25:08,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:25:08,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:25:08" (1/1) ... [2022-10-16 14:25:08,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4529f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:08, skipping insertion in model container [2022-10-16 14:25:08,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:25:08" (1/1) ... [2022-10-16 14:25:08,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:25:08,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:25:09,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-10-16 14:25:09,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:25:09,153 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:25:09,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-10-16 14:25:09,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:25:09,219 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:25:09,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09 WrapperNode [2022-10-16 14:25:09,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:25:09,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:25:09,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:25:09,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:25:09,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,274 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 146 [2022-10-16 14:25:09,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:25:09,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:25:09,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:25:09,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:25:09,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:25:09,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:25:09,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:25:09,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:25:09,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (1/1) ... [2022-10-16 14:25:09,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:25:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:09,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 14:25:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 14:25:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:25:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:25:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:25:09,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:25:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-10-16 14:25:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-10-16 14:25:09,555 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:25:09,558 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:25:09,951 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:25:09,960 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:25:09,960 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-16 14:25:09,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:25:09 BoogieIcfgContainer [2022-10-16 14:25:09,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:25:09,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:25:09,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:25:09,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:25:09,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:25:08" (1/3) ... [2022-10-16 14:25:09,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff76f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:25:09, skipping insertion in model container [2022-10-16 14:25:09,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:09" (2/3) ... [2022-10-16 14:25:09,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff76f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:25:09, skipping insertion in model container [2022-10-16 14:25:09,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:25:09" (3/3) ... [2022-10-16 14:25:09,977 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-10-16 14:25:10,003 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:25:10,003 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-16 14:25:10,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:25:10,140 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@434a5162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:25:10,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-16 14:25:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 59 states have (on average 1.847457627118644) internal successors, (109), 92 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-10-16 14:25:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 14:25:10,157 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:10,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:10,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2087058924, now seen corresponding path program 1 times [2022-10-16 14:25:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:10,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655547900] [2022-10-16 14:25:10,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:25:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:10,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655547900] [2022-10-16 14:25:10,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655547900] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:10,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:25:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675841449] [2022-10-16 14:25:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:10,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:10,577 INFO L87 Difference]: Start difference. First operand has 109 states, 59 states have (on average 1.847457627118644) internal successors, (109), 92 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-10-16 14:25:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:10,786 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2022-10-16 14:25:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-16 14:25:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:10,809 INFO L225 Difference]: With dead ends: 194 [2022-10-16 14:25:10,809 INFO L226 Difference]: Without dead ends: 99 [2022-10-16 14:25:10,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:10,824 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 87 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-16 14:25:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-10-16 14:25:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 82 states have internal predecessors, (85), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-10-16 14:25:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-10-16 14:25:10,935 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 11 [2022-10-16 14:25:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:10,936 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-10-16 14:25:10,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-10-16 14:25:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-10-16 14:25:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 14:25:10,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:10,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:10,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:25:10,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -274318795, now seen corresponding path program 1 times [2022-10-16 14:25:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:10,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307697737] [2022-10-16 14:25:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:25:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307697737] [2022-10-16 14:25:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307697737] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:11,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:11,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:25:11,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920093806] [2022-10-16 14:25:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:11,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:11,052 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:25:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:11,090 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2022-10-16 14:25:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 14:25:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:11,092 INFO L225 Difference]: With dead ends: 185 [2022-10-16 14:25:11,093 INFO L226 Difference]: Without dead ends: 99 [2022-10-16 14:25:11,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:11,096 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:11,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-16 14:25:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-10-16 14:25:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 82 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-10-16 14:25:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-10-16 14:25:11,112 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 12 [2022-10-16 14:25:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:11,113 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-10-16 14:25:11,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:25:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-10-16 14:25:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 14:25:11,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:11,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:11,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:25:11,115 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -274317129, now seen corresponding path program 1 times [2022-10-16 14:25:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:11,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633927883] [2022-10-16 14:25:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:25:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:11,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633927883] [2022-10-16 14:25:11,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633927883] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:11,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:11,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:25:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718786598] [2022-10-16 14:25:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:11,214 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:25:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:11,304 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-10-16 14:25:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 14:25:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:11,306 INFO L225 Difference]: With dead ends: 99 [2022-10-16 14:25:11,306 INFO L226 Difference]: Without dead ends: 94 [2022-10-16 14:25:11,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:11,309 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 65 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:11,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 114 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-16 14:25:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-10-16 14:25:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 77 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-10-16 14:25:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-10-16 14:25:11,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 12 [2022-10-16 14:25:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:11,326 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-10-16 14:25:11,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:25:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-10-16 14:25:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 14:25:11,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:11,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:11,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:25:11,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753319, now seen corresponding path program 1 times [2022-10-16 14:25:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:11,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532084153] [2022-10-16 14:25:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:25:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532084153] [2022-10-16 14:25:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532084153] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:25:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892675358] [2022-10-16 14:25:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:11,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:25:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:25:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:25:11,400 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-16 14:25:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:11,565 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-10-16 14:25:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:25:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-10-16 14:25:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:11,568 INFO L225 Difference]: With dead ends: 125 [2022-10-16 14:25:11,568 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 14:25:11,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:25:11,571 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 98 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:11,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 184 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 14:25:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-10-16 14:25:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.36986301369863) internal successors, (100), 92 states have internal predecessors, (100), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-10-16 14:25:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-10-16 14:25:11,593 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 14 [2022-10-16 14:25:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:11,593 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-10-16 14:25:11,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-16 14:25:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-10-16 14:25:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 14:25:11,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:11,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:11,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 14:25:11,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1141254748, now seen corresponding path program 1 times [2022-10-16 14:25:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:11,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728928565] [2022-10-16 14:25:11,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:11,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:25:11,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728928565] [2022-10-16 14:25:11,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728928565] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:11,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:25:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318181171] [2022-10-16 14:25:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:11,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:25:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:25:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:25:11,693 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-10-16 14:25:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:11,870 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-10-16 14:25:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:25:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-10-16 14:25:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:11,873 INFO L225 Difference]: With dead ends: 116 [2022-10-16 14:25:11,874 INFO L226 Difference]: Without dead ends: 108 [2022-10-16 14:25:11,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:25:11,881 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 100 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:11,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 99 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-16 14:25:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-16 14:25:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-10-16 14:25:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2022-10-16 14:25:11,927 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 15 [2022-10-16 14:25:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:11,927 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-10-16 14:25:11,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-10-16 14:25:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-10-16 14:25:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 14:25:11,935 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:11,936 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:11,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 14:25:11,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1112571910, now seen corresponding path program 1 times [2022-10-16 14:25:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:11,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60995372] [2022-10-16 14:25:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 14:25:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 14:25:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-10-16 14:25:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60995372] [2022-10-16 14:25:12,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60995372] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138219920] [2022-10-16 14:25:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:12,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 14:25:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:12,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:25:12,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-10-16 14:25:12,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:25:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-10-16 14:25:12,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138219920] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:25:12,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:25:12,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-10-16 14:25:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452185017] [2022-10-16 14:25:12,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:25:12,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 14:25:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 14:25:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:25:12,721 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-10-16 14:25:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:13,646 INFO L93 Difference]: Finished difference Result 452 states and 629 transitions. [2022-10-16 14:25:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 14:25:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 70 [2022-10-16 14:25:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:13,652 INFO L225 Difference]: With dead ends: 452 [2022-10-16 14:25:13,652 INFO L226 Difference]: Without dead ends: 446 [2022-10-16 14:25:13,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2022-10-16 14:25:13,655 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 924 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:13,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 497 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 14:25:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-10-16 14:25:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 281. [2022-10-16 14:25:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 195 states have (on average 1.2307692307692308) internal successors, (240), 210 states have internal predecessors, (240), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-16 14:25:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 396 transitions. [2022-10-16 14:25:13,711 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 396 transitions. Word has length 70 [2022-10-16 14:25:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:13,712 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 396 transitions. [2022-10-16 14:25:13,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-10-16 14:25:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 396 transitions. [2022-10-16 14:25:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 14:25:13,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:13,716 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:13,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:13,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 14:25:13,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 230966225, now seen corresponding path program 1 times [2022-10-16 14:25:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:13,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590821947] [2022-10-16 14:25:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:25:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 14:25:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 14:25:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 14:25:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 14:25:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 14:25:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-10-16 14:25:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590821947] [2022-10-16 14:25:14,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590821947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:14,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:25:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707343593] [2022-10-16 14:25:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:14,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,066 INFO L87 Difference]: Start difference. First operand 281 states and 396 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 14:25:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:14,153 INFO L93 Difference]: Finished difference Result 400 states and 576 transitions. [2022-10-16 14:25:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2022-10-16 14:25:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:14,157 INFO L225 Difference]: With dead ends: 400 [2022-10-16 14:25:14,157 INFO L226 Difference]: Without dead ends: 281 [2022-10-16 14:25:14,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,159 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:14,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-10-16 14:25:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-10-16 14:25:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 195 states have (on average 1.2) internal successors, (234), 210 states have internal predecessors, (234), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-16 14:25:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2022-10-16 14:25:14,194 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 91 [2022-10-16 14:25:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:14,195 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2022-10-16 14:25:14,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 14:25:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2022-10-16 14:25:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 14:25:14,197 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:14,198 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:14,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 14:25:14,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1551752532, now seen corresponding path program 1 times [2022-10-16 14:25:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:14,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84587187] [2022-10-16 14:25:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-10-16 14:25:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84587187] [2022-10-16 14:25:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84587187] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:14,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:14,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:25:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7383490] [2022-10-16 14:25:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:14,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:14,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,388 INFO L87 Difference]: Start difference. First operand 281 states and 390 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 14:25:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:14,422 INFO L93 Difference]: Finished difference Result 281 states and 390 transitions. [2022-10-16 14:25:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2022-10-16 14:25:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:14,428 INFO L225 Difference]: With dead ends: 281 [2022-10-16 14:25:14,429 INFO L226 Difference]: Without dead ends: 280 [2022-10-16 14:25:14,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,430 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-10-16 14:25:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-10-16 14:25:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 195 states have (on average 1.1743589743589744) internal successors, (229), 209 states have internal predecessors, (229), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-16 14:25:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2022-10-16 14:25:14,491 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 92 [2022-10-16 14:25:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:14,492 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2022-10-16 14:25:14,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 14:25:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2022-10-16 14:25:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-16 14:25:14,499 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:14,500 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:14,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 14:25:14,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -859688054, now seen corresponding path program 1 times [2022-10-16 14:25:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:14,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535321585] [2022-10-16 14:25:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-10-16 14:25:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535321585] [2022-10-16 14:25:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535321585] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:25:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892103592] [2022-10-16 14:25:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,649 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 14:25:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:14,688 INFO L93 Difference]: Finished difference Result 280 states and 385 transitions. [2022-10-16 14:25:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:14,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2022-10-16 14:25:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:14,692 INFO L225 Difference]: With dead ends: 280 [2022-10-16 14:25:14,692 INFO L226 Difference]: Without dead ends: 279 [2022-10-16 14:25:14,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,693 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:14,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-10-16 14:25:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-10-16 14:25:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 195 states have (on average 1.1487179487179486) internal successors, (224), 208 states have internal predecessors, (224), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-16 14:25:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 380 transitions. [2022-10-16 14:25:14,731 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 380 transitions. Word has length 93 [2022-10-16 14:25:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:14,732 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 380 transitions. [2022-10-16 14:25:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 14:25:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 380 transitions. [2022-10-16 14:25:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-16 14:25:14,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:14,734 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:14,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 14:25:14,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -219702225, now seen corresponding path program 1 times [2022-10-16 14:25:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365922983] [2022-10-16 14:25:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 14:25:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 14:25:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-10-16 14:25:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365922983] [2022-10-16 14:25:14,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365922983] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:14,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:14,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:25:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549029600] [2022-10-16 14:25:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,841 INFO L87 Difference]: Start difference. First operand 279 states and 380 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:25:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:14,880 INFO L93 Difference]: Finished difference Result 374 states and 521 transitions. [2022-10-16 14:25:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2022-10-16 14:25:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:14,883 INFO L225 Difference]: With dead ends: 374 [2022-10-16 14:25:14,884 INFO L226 Difference]: Without dead ends: 279 [2022-10-16 14:25:14,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:14,886 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:14,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-10-16 14:25:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-10-16 14:25:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 195 states have (on average 1.123076923076923) internal successors, (219), 208 states have internal predecessors, (219), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-16 14:25:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 375 transitions. [2022-10-16 14:25:14,924 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 375 transitions. Word has length 105 [2022-10-16 14:25:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:14,925 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 375 transitions. [2022-10-16 14:25:14,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:25:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 375 transitions. [2022-10-16 14:25:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 14:25:14,927 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:14,927 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:14,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 14:25:14,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1239451563, now seen corresponding path program 1 times [2022-10-16 14:25:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:14,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627214720] [2022-10-16 14:25:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 14:25:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 14:25:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-10-16 14:25:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:15,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627214720] [2022-10-16 14:25:15,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627214720] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:15,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:25:15,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 14:25:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848238139] [2022-10-16 14:25:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:15,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:25:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:25:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 14:25:15,094 INFO L87 Difference]: Start difference. First operand 279 states and 375 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:25:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:15,145 INFO L93 Difference]: Finished difference Result 339 states and 453 transitions. [2022-10-16 14:25:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:25:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2022-10-16 14:25:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:15,149 INFO L225 Difference]: With dead ends: 339 [2022-10-16 14:25:15,149 INFO L226 Difference]: Without dead ends: 337 [2022-10-16 14:25:15,150 INFO L412 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 [2022-10-16 14:25:15,151 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 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 [2022-10-16 14:25:15,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-10-16 14:25:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2022-10-16 14:25:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 244 states have (on average 1.110655737704918) internal successors, (271), 256 states have internal predecessors, (271), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-10-16 14:25:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 443 transitions. [2022-10-16 14:25:15,196 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 443 transitions. Word has length 107 [2022-10-16 14:25:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:15,197 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 443 transitions. [2022-10-16 14:25:15,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 14:25:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 443 transitions. [2022-10-16 14:25:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-10-16 14:25:15,200 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:15,200 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 14:25:15,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 140886982, now seen corresponding path program 2 times [2022-10-16 14:25:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:15,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484280862] [2022-10-16 14:25:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 14:25:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 14:25:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 14:25:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 14:25:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 14:25:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 14:25:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 14:25:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-16 14:25:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 14:25:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 14:25:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-10-16 14:25:15,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:15,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484280862] [2022-10-16 14:25:15,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484280862] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:15,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523141403] [2022-10-16 14:25:15,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:25:15,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:15,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:15,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 14:25:15,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:25:15,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:25:15,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 14:25:15,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-10-16 14:25:15,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:25:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-10-16 14:25:16,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523141403] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:25:16,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:25:16,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-10-16 14:25:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979757267] [2022-10-16 14:25:16,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:25:16,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 14:25:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:16,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 14:25:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-10-16 14:25:16,014 INFO L87 Difference]: Start difference. First operand 336 states and 443 transitions. Second operand has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2022-10-16 14:25:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:18,062 INFO L93 Difference]: Finished difference Result 975 states and 1302 transitions. [2022-10-16 14:25:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 14:25:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 134 [2022-10-16 14:25:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:18,071 INFO L225 Difference]: With dead ends: 975 [2022-10-16 14:25:18,071 INFO L226 Difference]: Without dead ends: 972 [2022-10-16 14:25:18,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1499, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 14:25:18,074 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 2087 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 1065 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2095 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1065 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:18,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2095 Valid, 636 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1065 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 14:25:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-10-16 14:25:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 763. [2022-10-16 14:25:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 559 states have (on average 1.110912343470483) internal successors, (621), 585 states have internal predecessors, (621), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2022-10-16 14:25:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1017 transitions. [2022-10-16 14:25:18,168 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1017 transitions. Word has length 134 [2022-10-16 14:25:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:18,168 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1017 transitions. [2022-10-16 14:25:18,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.411764705882353) internal successors, (109), 18 states have internal predecessors, (109), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2022-10-16 14:25:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1017 transitions. [2022-10-16 14:25:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-10-16 14:25:18,172 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:18,173 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:18,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:18,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-16 14:25:18,389 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1793027604, now seen corresponding path program 1 times [2022-10-16 14:25:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771971388] [2022-10-16 14:25:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 14:25:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 14:25:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 14:25:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 14:25:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 14:25:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 14:25:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 14:25:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 14:25:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-10-16 14:25:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771971388] [2022-10-16 14:25:18,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771971388] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:18,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494243500] [2022-10-16 14:25:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:18,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:18,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:25:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:18,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:25:18,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-10-16 14:25:18,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:25:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-10-16 14:25:18,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494243500] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:25:18,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:25:18,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-10-16 14:25:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553913837] [2022-10-16 14:25:18,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:25:18,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 14:25:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 14:25:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:25:18,859 INFO L87 Difference]: Start difference. First operand 763 states and 1017 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2022-10-16 14:25:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:19,065 INFO L93 Difference]: Finished difference Result 1261 states and 1760 transitions. [2022-10-16 14:25:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:25:19,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 149 [2022-10-16 14:25:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:19,076 INFO L225 Difference]: With dead ends: 1261 [2022-10-16 14:25:19,076 INFO L226 Difference]: Without dead ends: 1260 [2022-10-16 14:25:19,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:25:19,078 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 33 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:19,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 310 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-10-16 14:25:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1256. [2022-10-16 14:25:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 878 states have (on average 1.1230068337129842) internal successors, (986), 931 states have internal predecessors, (986), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2022-10-16 14:25:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1730 transitions. [2022-10-16 14:25:19,276 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1730 transitions. Word has length 149 [2022-10-16 14:25:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:19,277 INFO L495 AbstractCegarLoop]: Abstraction has 1256 states and 1730 transitions. [2022-10-16 14:25:19,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2022-10-16 14:25:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1730 transitions. [2022-10-16 14:25:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-10-16 14:25:19,282 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:19,283 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:19,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:19,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:19,498 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 250719324, now seen corresponding path program 1 times [2022-10-16 14:25:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:19,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490753154] [2022-10-16 14:25:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 14:25:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 14:25:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 14:25:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 14:25:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 14:25:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 14:25:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 14:25:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 14:25:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-10-16 14:25:19,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490753154] [2022-10-16 14:25:19,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490753154] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:19,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438610669] [2022-10-16 14:25:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:19,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:19,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:25:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:19,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:25:19,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-10-16 14:25:19,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:25:19,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438610669] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:25:19,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:25:19,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-10-16 14:25:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899841622] [2022-10-16 14:25:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:25:19,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:25:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:25:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:25:19,803 INFO L87 Difference]: Start difference. First operand 1256 states and 1730 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-16 14:25:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:20,018 INFO L93 Difference]: Finished difference Result 1257 states and 1730 transitions. [2022-10-16 14:25:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:25:20,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 150 [2022-10-16 14:25:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:20,028 INFO L225 Difference]: With dead ends: 1257 [2022-10-16 14:25:20,028 INFO L226 Difference]: Without dead ends: 1256 [2022-10-16 14:25:20,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:25:20,030 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:20,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 263 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:25:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2022-10-16 14:25:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1255. [2022-10-16 14:25:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 878 states have (on average 1.0888382687927107) internal successors, (956), 930 states have internal predecessors, (956), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2022-10-16 14:25:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1700 transitions. [2022-10-16 14:25:20,200 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1700 transitions. Word has length 150 [2022-10-16 14:25:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:20,201 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1700 transitions. [2022-10-16 14:25:20,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-16 14:25:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1700 transitions. [2022-10-16 14:25:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-10-16 14:25:20,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:20,211 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:20,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:20,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:20,426 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1366307691, now seen corresponding path program 3 times [2022-10-16 14:25:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:20,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968983749] [2022-10-16 14:25:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 14:25:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 14:25:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 14:25:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 14:25:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 14:25:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 14:25:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 14:25:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-16 14:25:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 14:25:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 14:25:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 14:25:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-10-16 14:25:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-10-16 14:25:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 14:25:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-10-16 14:25:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 14:25:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 14:25:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 14:25:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-10-16 14:25:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-10-16 14:25:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-10-16 14:25:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-10-16 14:25:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-10-16 14:25:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-10-16 14:25:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2022-10-16 14:25:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:21,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968983749] [2022-10-16 14:25:21,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968983749] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:21,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282565538] [2022-10-16 14:25:21,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 14:25:21,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:21,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:21,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 14:25:21,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 14:25:21,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:25:21,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 14:25:21,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 108 proven. 27 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2022-10-16 14:25:21,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:25:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 84 proven. 51 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2022-10-16 14:25:21,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282565538] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:25:21,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:25:21,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2022-10-16 14:25:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954734173] [2022-10-16 14:25:21,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:25:21,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 14:25:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:21,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 14:25:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2022-10-16 14:25:21,949 INFO L87 Difference]: Start difference. First operand 1255 states and 1700 transitions. Second operand has 25 states, 24 states have (on average 6.125) internal successors, (147), 23 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2022-10-16 14:25:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:22,513 INFO L93 Difference]: Finished difference Result 1332 states and 1788 transitions. [2022-10-16 14:25:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 14:25:22,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 23 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 246 [2022-10-16 14:25:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:22,526 INFO L225 Difference]: With dead ends: 1332 [2022-10-16 14:25:22,526 INFO L226 Difference]: Without dead ends: 1329 [2022-10-16 14:25:22,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2022-10-16 14:25:22,530 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 207 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:22,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 204 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:25:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-10-16 14:25:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 142. [2022-10-16 14:25:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 108 states have internal predecessors, (109), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-10-16 14:25:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2022-10-16 14:25:22,624 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 246 [2022-10-16 14:25:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:22,629 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2022-10-16 14:25:22,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 23 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2022-10-16 14:25:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2022-10-16 14:25:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-10-16 14:25:22,633 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:25:22,634 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:22,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 14:25:22,842 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-10-16 14:25:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:25:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2109298385, now seen corresponding path program 2 times [2022-10-16 14:25:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:25:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260671322] [2022-10-16 14:25:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:25:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:25:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 14:25:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-16 14:25:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 14:25:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:25:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 14:25:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 14:25:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:25:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 14:25:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 14:25:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:25:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 14:25:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 14:25:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 14:25:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 14:25:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 14:25:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 14:25:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 14:25:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 14:25:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-10-16 14:25:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-10-16 14:25:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 14:25:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-10-16 14:25:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 14:25:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-10-16 14:25:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 14:25:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-10-16 14:25:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-10-16 14:25:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-10-16 14:25:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-10-16 14:25:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-10-16 14:25:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-10-16 14:25:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-10-16 14:25:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-10-16 14:25:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-10-16 14:25:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-10-16 14:25:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 14:25:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:25:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2672 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2022-10-16 14:25:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:25:23,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260671322] [2022-10-16 14:25:23,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260671322] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:25:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370695377] [2022-10-16 14:25:23,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:25:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:25:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:25:23,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:25:23,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 14:25:23,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:25:23,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:25:23,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 14:25:23,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:25:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2672 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-10-16 14:25:23,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:25:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2672 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2022-10-16 14:25:23,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370695377] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:25:23,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:25:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-10-16 14:25:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28101101] [2022-10-16 14:25:23,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:25:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 14:25:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:25:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 14:25:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-10-16 14:25:23,704 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2022-10-16 14:25:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:25:23,970 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2022-10-16 14:25:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 14:25:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 275 [2022-10-16 14:25:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:25:23,972 INFO L225 Difference]: With dead ends: 173 [2022-10-16 14:25:23,972 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 14:25:23,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2022-10-16 14:25:23,974 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 181 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:25:23,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 414 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:25:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 14:25:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 14:25:23,975 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) [2022-10-16 14:25:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 14:25:23,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2022-10-16 14:25:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:25:23,975 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 14:25:23,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2022-10-16 14:25:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 14:25:23,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 14:25:23,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-10-16 14:25:23,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-10-16 14:25:23,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-10-16 14:25:23,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-10-16 14:25:23,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-10-16 14:25:23,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-10-16 14:25:23,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-10-16 14:25:23,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-10-16 14:25:23,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-10-16 14:25:23,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-10-16 14:25:23,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-10-16 14:25:23,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-10-16 14:25:23,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-10-16 14:25:23,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-10-16 14:25:23,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-10-16 14:25:23,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-10-16 14:25:23,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-10-16 14:25:23,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-10-16 14:25:23,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-10-16 14:25:23,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-10-16 14:25:23,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-10-16 14:25:23,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-10-16 14:25:23,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-10-16 14:25:23,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-10-16 14:25:23,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-10-16 14:25:23,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-10-16 14:25:23,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-10-16 14:25:23,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-10-16 14:25:23,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-10-16 14:25:23,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-10-16 14:25:24,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 14:25:24,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 14:25:24,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 14:25:31,076 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-10-16 14:25:31,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-16 14:25:31,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-10-16 14:25:31,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 14:25:31,080 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-10-16 14:25:31,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 14:25:31,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,081 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) .cse0 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse3) (and .cse0 (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999999) .cse3))) [2022-10-16 14:25:31,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2022-10-16 14:25:31,081 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,081 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-16 14:25:31,082 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-10-16 14:25:31,082 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-10-16 14:25:31,082 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-10-16 14:25:31,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2022-10-16 14:25:31,082 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-10-16 14:25:31,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2022-10-16 14:25:31,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-16 14:25:31,083 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,084 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-10-16 14:25:31,084 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,084 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2022-10-16 14:25:31,084 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2022-10-16 14:25:31,084 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2022-10-16 14:25:31,084 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,085 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,085 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-10-16 14:25:31,085 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,085 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-10-16 14:25:31,085 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-10-16 14:25:31,085 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-10-16 14:25:31,086 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2022-10-16 14:25:31,086 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 46 52) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,086 INFO L895 garLoopResultBuilder]: At program point L47-4(lines 47 52) the Hoare annotation is: (let ((.cse0 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse4 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) .cse0 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse4) (and .cse0 (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-10-16 14:25:31,086 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-16 14:25:31,087 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,087 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,087 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-10-16 14:25:31,087 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-10-16 14:25:31,087 INFO L895 garLoopResultBuilder]: At program point L56-2(line 56) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,088 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2022-10-16 14:25:31,088 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2022-10-16 14:25:31,088 INFO L895 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: (<= |ULTIMATE.start_main_~urilen~0#1| 2147483647) [2022-10-16 14:25:31,088 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-10-16 14:25:31,088 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-16 14:25:31,088 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (< |ULTIMATE.start_main_~c~0#1| 2147483643) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-10-16 14:25:31,089 INFO L895 garLoopResultBuilder]: At program point L65-5(lines 64 77) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (< |ULTIMATE.start_main_~c~0#1| 2147483643) .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-10-16 14:25:31,090 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-10-16 14:25:31,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-10-16 14:25:31,090 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,090 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2022-10-16 14:25:31,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-10-16 14:25:31,090 INFO L895 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: (<= |ULTIMATE.start_main_~urilen~0#1| 2147483647) [2022-10-16 14:25:31,091 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,091 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,091 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-10-16 14:25:31,091 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-10-16 14:25:31,091 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-10-16 14:25:31,091 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-10-16 14:25:31,092 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-10-16 14:25:31,093 INFO L895 garLoopResultBuilder]: At program point L42-2(line 42) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,093 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2022-10-16 14:25:31,094 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7))) [2022-10-16 14:25:31,094 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-10-16 14:25:31,094 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse3 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse4 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse5 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-10-16 14:25:31,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-10-16 14:25:31,095 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (or (<= |ULTIMATE.start_main_~scheme~0#1| 999999) |ULTIMATE.start_main_#t~short4#1|) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-10-16 14:25:31,096 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-10-16 14:25:31,097 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-10-16 14:25:31,097 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-10-16 14:25:31,097 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-10-16 14:25:31,097 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-10-16 14:25:31,101 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:25:31,104 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 14:25:31,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:25:31 BoogieIcfgContainer [2022-10-16 14:25:31,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 14:25:31,127 INFO L158 Benchmark]: Toolchain (without parser) took 22296.15ms. Allocated memory was 159.4MB in the beginning and 342.9MB in the end (delta: 183.5MB). Free memory was 132.7MB in the beginning and 288.4MB in the end (delta: -155.6MB). Peak memory consumption was 201.6MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,127 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 14:25:31,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.48ms. Allocated memory is still 159.4MB. Free memory was 132.6MB in the beginning and 121.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.73ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,128 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 118.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,128 INFO L158 Benchmark]: RCFGBuilder took 649.16ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 135.3MB in the end (delta: -16.5MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,129 INFO L158 Benchmark]: TraceAbstraction took 21160.00ms. Allocated memory was 159.4MB in the beginning and 342.9MB in the end (delta: 183.5MB). Free memory was 134.8MB in the beginning and 288.4MB in the end (delta: -153.6MB). Peak memory consumption was 203.4MB. Max. memory is 8.0GB. [2022-10-16 14:25:31,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 379.48ms. Allocated memory is still 159.4MB. Free memory was 132.6MB in the beginning and 121.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.73ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 118.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 649.16ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 135.3MB in the end (delta: -16.5MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * TraceAbstraction took 21160.00ms. Allocated memory was 159.4MB in the beginning and 342.9MB in the end (delta: 183.5MB). Free memory was 134.8MB in the beginning and 288.4MB in the end (delta: -153.6MB). Peak memory consumption was 203.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3912 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3832 mSDsluCounter, 3845 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2050 mSDsCounter, 1828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2270 IncrementalHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1828 mSolverCounterUnsat, 1795 mSDtfsCounter, 2270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2376 GetRequests, 2231 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1256occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 1569 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 171 PreInvPairs, 231 NumberOfFragments, 885 HoareAnnotationTreeSize, 171 FomulaSimplifications, 16728 FormulaSimplificationTreeSizeReduction, 4.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 50133 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2600 NumberOfCodeBlocks, 2391 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3447 ConstructedInterpolants, 0 QuantifiedInterpolants, 6226 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1524 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19932/21399 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((urilen <= 1000000 && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && 0 <= urilen + 1000000) && 0 <= 1000000 + tokenlen) && 0 <= cp) && 0 <= scheme) && cp <= 999999) && tokenlen <= 1000000) && scheme <= 1000000 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: urilen <= 2147483647 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: urilen <= 2147483647 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000 && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && c < 2147483643) && 0 <= urilen + 1000000) && 1 <= c) && 0 <= 1000000 + tokenlen) && 0 <= cp) && cp <= 1000000) && 0 <= scheme) && tokenlen <= 1000000) || ((((((((c == 0 && urilen <= 1000000) && (scheme <= 999999 || aux-scheme == 0 || (urilen-1 < scheme)-aux)) && 0 <= urilen + 1000000) && 0 <= 1000000 + tokenlen) && 0 <= cp) && cp <= 1000000) && 0 <= scheme) && tokenlen <= 1000000) RESULT: Ultimate proved your program to be correct! [2022-10-16 14:25:31,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...