/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/array-tiling/pnr4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 20:33:36,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 20:33:36,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 20:33:36,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 20:33:36,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 20:33:36,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 20:33:36,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 20:33:36,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 20:33:36,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 20:33:36,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 20:33:36,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 20:33:36,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 20:33:36,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 20:33:36,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 20:33:36,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 20:33:36,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 20:33:36,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 20:33:36,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 20:33:36,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 20:33:36,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 20:33:36,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 20:33:36,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 20:33:36,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 20:33:36,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 20:33:36,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 20:33:36,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 20:33:36,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 20:33:36,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 20:33:36,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 20:33:36,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 20:33:36,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 20:33:36,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 20:33:36,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 20:33:36,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 20:33:36,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 20:33:36,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 20:33:36,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 20:33:36,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 20:33:36,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 20:33:36,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 20:33:36,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 20:33:36,447 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-15 20:33:36,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 20:33:36,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 20:33:36,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 20:33:36,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 20:33:36,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 20:33:36,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 20:33:36,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 20:33:36,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 20:33:36,509 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 20:33:36,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 20:33:36,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 20:33:36,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 20:33:36,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 20:33:36,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 20:33:36,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 20:33:36,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 20:33:36,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 20:33:36,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 20:33:36,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 20:33:36,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 20:33:36,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 20:33:36,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:33:36,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 20:33:36,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 20:33:36,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 20:33:36,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 20:33:36,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 20:33:36,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 20:33:36,516 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-15 20:33:36,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 20:33:37,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 20:33:37,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 20:33:37,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 20:33:37,030 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 20:33:37,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr4.c [2022-10-15 20:33:37,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccae3195a/d9f1209a136e43dd86467bdf5891bc6e/FLAGe0f20f529 [2022-10-15 20:33:37,749 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 20:33:37,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr4.c [2022-10-15 20:33:37,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccae3195a/d9f1209a136e43dd86467bdf5891bc6e/FLAGe0f20f529 [2022-10-15 20:33:38,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccae3195a/d9f1209a136e43dd86467bdf5891bc6e [2022-10-15 20:33:38,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 20:33:38,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 20:33:38,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 20:33:38,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 20:33:38,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 20:33:38,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bced0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38, skipping insertion in model container [2022-10-15 20:33:38,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 20:33:38,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 20:33:38,356 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/array-tiling/pnr4.c[395,408] [2022-10-15 20:33:38,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:33:38,404 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 20:33:38,421 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/array-tiling/pnr4.c[395,408] [2022-10-15 20:33:38,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:33:38,457 INFO L208 MainTranslator]: Completed translation [2022-10-15 20:33:38,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38 WrapperNode [2022-10-15 20:33:38,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 20:33:38,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 20:33:38,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 20:33:38,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 20:33:38,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,512 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 129 [2022-10-15 20:33:38,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 20:33:38,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 20:33:38,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 20:33:38,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 20:33:38,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,546 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 20:33:38,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 20:33:38,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 20:33:38,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 20:33:38,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (1/1) ... [2022-10-15 20:33:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:33:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:38,616 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-15 20:33:38,637 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-15 20:33:38,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 20:33:38,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 20:33:38,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 20:33:38,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 20:33:38,684 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2022-10-15 20:33:38,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2022-10-15 20:33:38,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 20:33:38,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 20:33:38,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 20:33:38,768 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 20:33:38,771 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 20:33:39,164 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 20:33:39,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 20:33:39,178 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 20:33:39,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:33:39 BoogieIcfgContainer [2022-10-15 20:33:39,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 20:33:39,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 20:33:39,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 20:33:39,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 20:33:39,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:33:38" (1/3) ... [2022-10-15 20:33:39,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352d4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:33:39, skipping insertion in model container [2022-10-15 20:33:39,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:33:38" (2/3) ... [2022-10-15 20:33:39,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352d4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:33:39, skipping insertion in model container [2022-10-15 20:33:39,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:33:39" (3/3) ... [2022-10-15 20:33:39,194 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr4.c [2022-10-15 20:33:39,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 20:33:39,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-10-15 20:33:39,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 20:33:39,349 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;@6c075914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 20:33:39,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-10-15 20:33:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 103 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 20:33:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 20:33:39,365 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:39,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:39,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash -655793907, now seen corresponding path program 1 times [2022-10-15 20:33:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069095700] [2022-10-15 20:33:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:40,097 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-15 20:33:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:40,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069095700] [2022-10-15 20:33:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069095700] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 20:33:40,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867003089] [2022-10-15 20:33:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:40,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:33:40,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:33:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:33:40,168 INFO L87 Difference]: Start difference. First operand has 109 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 103 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-15 20:33:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:40,431 INFO L93 Difference]: Finished difference Result 218 states and 243 transitions. [2022-10-15 20:33:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 20:33:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-10-15 20:33:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:40,448 INFO L225 Difference]: With dead ends: 218 [2022-10-15 20:33:40,450 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 20:33:40,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:33:40,465 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 421 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:40,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 20:33:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 20:33:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 96 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 20:33:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2022-10-15 20:33:40,545 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 7 [2022-10-15 20:33:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:40,545 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2022-10-15 20:33:40,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-15 20:33:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2022-10-15 20:33:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 20:33:40,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:40,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:40,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 20:33:40,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1693514460, now seen corresponding path program 1 times [2022-10-15 20:33:40,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:40,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630492105] [2022-10-15 20:33:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:40,670 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-15 20:33:40,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630492105] [2022-10-15 20:33:40,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630492105] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:40,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:40,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:33:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877848773] [2022-10-15 20:33:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:40,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:33:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:33:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:33:40,675 INFO L87 Difference]: Start difference. First operand 102 states and 110 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-15 20:33:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:40,821 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-10-15 20:33:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:33:40,822 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-15 20:33:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:40,828 INFO L225 Difference]: With dead ends: 110 [2022-10-15 20:33:40,828 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 20:33:40,833 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-15 20:33:40,836 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:40,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 20:33:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-15 20:33:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 102 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 20:33:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-10-15 20:33:40,880 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 15 [2022-10-15 20:33:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:40,882 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-10-15 20:33:40,882 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-15 20:33:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-10-15 20:33:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 20:33:40,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:40,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 20:33:40,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 294604879, now seen corresponding path program 1 times [2022-10-15 20:33:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689111953] [2022-10-15 20:33:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:40,972 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-15 20:33:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:40,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689111953] [2022-10-15 20:33:40,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689111953] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:40,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:40,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:33:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557064841] [2022-10-15 20:33:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:33:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:33:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:33:40,976 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 20:33:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:41,163 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2022-10-15 20:33:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:33:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-15 20:33:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:41,165 INFO L225 Difference]: With dead ends: 193 [2022-10-15 20:33:41,166 INFO L226 Difference]: Without dead ends: 161 [2022-10-15 20:33:41,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 20:33:41,168 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 47 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:41,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 114 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:33:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-15 20:33:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2022-10-15 20:33:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 145 states have internal predecessors, (156), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 20:33:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2022-10-15 20:33:41,188 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 16 [2022-10-15 20:33:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:41,190 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2022-10-15 20:33:41,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 20:33:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2022-10-15 20:33:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 20:33:41,192 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:41,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:41,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 20:33:41,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1995089359, now seen corresponding path program 1 times [2022-10-15 20:33:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114948673] [2022-10-15 20:33:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:33:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114948673] [2022-10-15 20:33:41,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114948673] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605700459] [2022-10-15 20:33:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:41,419 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-15 20:33:41,443 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-15 20:33:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:41,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:33:41,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:33:41,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:33:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:33:41,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605700459] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:33:41,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:33:41,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-15 20:33:41,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486973189] [2022-10-15 20:33:41,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:33:41,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 20:33:41,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:41,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 20:33:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-15 20:33:41,642 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-15 20:33:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:42,089 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-10-15 20:33:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 20:33:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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 21 [2022-10-15 20:33:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:42,092 INFO L225 Difference]: With dead ends: 183 [2022-10-15 20:33:42,092 INFO L226 Difference]: Without dead ends: 182 [2022-10-15 20:33:42,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-15 20:33:42,094 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:42,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 259 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 20:33:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-15 20:33:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2022-10-15 20:33:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 162 states have internal predecessors, (175), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 20:33:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2022-10-15 20:33:42,112 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 21 [2022-10-15 20:33:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:42,112 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2022-10-15 20:33:42,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-15 20:33:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2022-10-15 20:33:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 20:33:42,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:42,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:42,156 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-15 20:33:42,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:42,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1718227796, now seen corresponding path program 1 times [2022-10-15 20:33:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:42,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677498191] [2022-10-15 20:33:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:42,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 20:33:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:42,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677498191] [2022-10-15 20:33:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677498191] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:42,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:42,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 20:33:42,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587117908] [2022-10-15 20:33:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:42,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 20:33:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 20:33:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:33:42,556 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-15 20:33:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:42,759 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2022-10-15 20:33:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 20:33:42,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 22 [2022-10-15 20:33:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:42,761 INFO L225 Difference]: With dead ends: 209 [2022-10-15 20:33:42,761 INFO L226 Difference]: Without dead ends: 177 [2022-10-15 20:33:42,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:33:42,763 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 361 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:42,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 94 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:33:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-15 20:33:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-10-15 20:33:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 162 states have internal predecessors, (174), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 20:33:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2022-10-15 20:33:42,778 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 22 [2022-10-15 20:33:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:42,779 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2022-10-15 20:33:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-15 20:33:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2022-10-15 20:33:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 20:33:42,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:42,781 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 20:33:42,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 20:33:42,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1834648900, now seen corresponding path program 1 times [2022-10-15 20:33:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:42,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208826564] [2022-10-15 20:33:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 20:33:42,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208826564] [2022-10-15 20:33:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208826564] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:42,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:42,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:33:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217328807] [2022-10-15 20:33:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:33:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:33:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:33:42,930 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:43,082 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-10-15 20:33:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:33:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-10-15 20:33:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:43,084 INFO L225 Difference]: With dead ends: 177 [2022-10-15 20:33:43,084 INFO L226 Difference]: Without dead ends: 175 [2022-10-15 20:33:43,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-15 20:33:43,086 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 23 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:43,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 188 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-10-15 20:33:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-10-15 20:33:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 165 states have internal predecessors, (177), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 20:33:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2022-10-15 20:33:43,099 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 51 [2022-10-15 20:33:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:43,100 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2022-10-15 20:33:43,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2022-10-15 20:33:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 20:33:43,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:43,103 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-10-15 20:33:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 20:33:43,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1702368676, now seen corresponding path program 1 times [2022-10-15 20:33:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:43,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911515687] [2022-10-15 20:33:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 20:33:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 20:33:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911515687] [2022-10-15 20:33:43,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911515687] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:43,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564502248] [2022-10-15 20:33:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:43,266 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-15 20:33:43,290 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-15 20:33:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:43,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:33:43,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 20:33:43,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:33:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 20:33:43,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564502248] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:33:43,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:33:43,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-10-15 20:33:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701767503] [2022-10-15 20:33:43,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:33:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 20:33:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 20:33:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:33:43,581 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-10-15 20:33:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:44,061 INFO L93 Difference]: Finished difference Result 239 states and 301 transitions. [2022-10-15 20:33:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 20:33:44,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 62 [2022-10-15 20:33:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:44,065 INFO L225 Difference]: With dead ends: 239 [2022-10-15 20:33:44,065 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 20:33:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-10-15 20:33:44,066 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 208 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:44,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 239 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 20:33:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 20:33:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2022-10-15 20:33:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 204 states have internal predecessors, (240), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 266 transitions. [2022-10-15 20:33:44,100 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 266 transitions. Word has length 62 [2022-10-15 20:33:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:44,101 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 266 transitions. [2022-10-15 20:33:44,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-10-15 20:33:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 266 transitions. [2022-10-15 20:33:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-15 20:33:44,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:44,103 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-10-15 20:33:44,141 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-15 20:33:44,316 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,SelfDestructingSolverStorable6 [2022-10-15 20:33:44,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1233821474, now seen corresponding path program 1 times [2022-10-15 20:33:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:44,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054718719] [2022-10-15 20:33:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:44,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 20:33:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 20:33:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054718719] [2022-10-15 20:33:44,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054718719] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6352132] [2022-10-15 20:33:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:44,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:44,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:44,530 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-15 20:33:44,537 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-15 20:33:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:33:44,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 20:33:44,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:33:44,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6352132] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:44,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:33:44,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-10-15 20:33:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806840652] [2022-10-15 20:33:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:44,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 20:33:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 20:33:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 20:33:44,705 INFO L87 Difference]: Start difference. First operand 219 states and 266 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 20:33:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:44,882 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2022-10-15 20:33:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:33:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2022-10-15 20:33:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:44,885 INFO L225 Difference]: With dead ends: 219 [2022-10-15 20:33:44,885 INFO L226 Difference]: Without dead ends: 202 [2022-10-15 20:33:44,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 20:33:44,887 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:44,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 171 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-10-15 20:33:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-10-15 20:33:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 183 states have (on average 1.1256830601092895) internal successors, (206), 187 states have internal predecessors, (206), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2022-10-15 20:33:44,909 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 63 [2022-10-15 20:33:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:44,910 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2022-10-15 20:33:44,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 20:33:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2022-10-15 20:33:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 20:33:44,915 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:44,916 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-10-15 20:33:44,961 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-15 20:33:45,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:45,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 461938241, now seen corresponding path program 1 times [2022-10-15 20:33:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:45,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331775386] [2022-10-15 20:33:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 20:33:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331775386] [2022-10-15 20:33:45,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331775386] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805258067] [2022-10-15 20:33:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:45,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:45,325 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-15 20:33:45,339 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-15 20:33:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:45,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:33:45,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 20:33:45,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:33:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805258067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:45,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:33:45,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 20:33:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291556152] [2022-10-15 20:33:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:45,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:33:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:33:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:33:45,478 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:45,642 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2022-10-15 20:33:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:33:45,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2022-10-15 20:33:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:45,646 INFO L225 Difference]: With dead ends: 202 [2022-10-15 20:33:45,646 INFO L226 Difference]: Without dead ends: 201 [2022-10-15 20:33:45,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:33:45,650 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:45,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 164 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-15 20:33:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-10-15 20:33:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 183 states have (on average 1.1092896174863387) internal successors, (203), 186 states have internal predecessors, (203), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 229 transitions. [2022-10-15 20:33:45,674 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 229 transitions. Word has length 68 [2022-10-15 20:33:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:45,675 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 229 transitions. [2022-10-15 20:33:45,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 229 transitions. [2022-10-15 20:33:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-15 20:33:45,681 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:45,681 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:45,724 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-15 20:33:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:45,896 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -280867653, now seen corresponding path program 1 times [2022-10-15 20:33:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:45,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991471063] [2022-10-15 20:33:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 20:33:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:46,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991471063] [2022-10-15 20:33:46,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991471063] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:46,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558378425] [2022-10-15 20:33:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:46,177 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-15 20:33:46,183 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-15 20:33:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:46,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 20:33:46,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 20:33:46,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:33:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 20:33:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558378425] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:33:46,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:33:46,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-10-15 20:33:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951035500] [2022-10-15 20:33:46,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:33:46,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 20:33:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:46,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 20:33:46,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-10-15 20:33:46,597 INFO L87 Difference]: Start difference. First operand 201 states and 229 transitions. Second operand has 24 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:47,051 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2022-10-15 20:33:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 20:33:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 85 [2022-10-15 20:33:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:47,054 INFO L225 Difference]: With dead ends: 239 [2022-10-15 20:33:47,055 INFO L226 Difference]: Without dead ends: 238 [2022-10-15 20:33:47,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2022-10-15 20:33:47,057 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 190 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:47,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 344 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 20:33:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-10-15 20:33:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2022-10-15 20:33:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 219 states have (on average 1.091324200913242) internal successors, (239), 222 states have internal predecessors, (239), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2022-10-15 20:33:47,076 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 85 [2022-10-15 20:33:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:47,076 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2022-10-15 20:33:47,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 20:33:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2022-10-15 20:33:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-10-15 20:33:47,079 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:47,079 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:47,119 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-15 20:33:47,293 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,SelfDestructingSolverStorable9 [2022-10-15 20:33:47,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1629609209, now seen corresponding path program 2 times [2022-10-15 20:33:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053245595] [2022-10-15 20:33:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 265 proven. 58 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 20:33:49,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053245595] [2022-10-15 20:33:49,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053245595] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463711884] [2022-10-15 20:33:49,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:33:49,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:49,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:49,227 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-15 20:33:49,248 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-15 20:33:49,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:33:49,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:33:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:33:49,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-10-15 20:33:49,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:33:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-10-15 20:33:49,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463711884] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:33:49,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:33:49,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4] total 32 [2022-10-15 20:33:49,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562391771] [2022-10-15 20:33:49,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:33:49,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-15 20:33:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-15 20:33:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-10-15 20:33:49,708 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 20:33:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:50,973 INFO L93 Difference]: Finished difference Result 303 states and 332 transitions. [2022-10-15 20:33:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 20:33:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2022-10-15 20:33:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:50,975 INFO L225 Difference]: With dead ends: 303 [2022-10-15 20:33:50,975 INFO L226 Difference]: Without dead ends: 170 [2022-10-15 20:33:50,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=443, Invalid=2209, Unknown=0, NotChecked=0, Total=2652 [2022-10-15 20:33:50,978 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 513 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:50,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 325 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 20:33:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-15 20:33:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-10-15 20:33:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.1045751633986929) internal successors, (169), 155 states have internal predecessors, (169), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2022-10-15 20:33:50,994 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 121 [2022-10-15 20:33:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:50,994 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2022-10-15 20:33:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.90625) internal successors, (157), 32 states have internal predecessors, (157), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 20:33:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2022-10-15 20:33:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-10-15 20:33:50,996 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:50,996 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:51,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-15 20:33:51,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:51,207 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -797216998, now seen corresponding path program 1 times [2022-10-15 20:33:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314696136] [2022-10-15 20:33:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 20:33:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 20:33:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 20:33:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-15 20:33:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 20:33:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-15 20:33:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 20:33:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-10-15 20:33:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-10-15 20:33:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:51,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314696136] [2022-10-15 20:33:51,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314696136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:33:51,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:33:51,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:33:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984493496] [2022-10-15 20:33:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:33:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:33:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:33:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:33:51,389 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 20:33:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:51,450 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2022-10-15 20:33:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:33:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 143 [2022-10-15 20:33:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:51,453 INFO L225 Difference]: With dead ends: 170 [2022-10-15 20:33:51,454 INFO L226 Difference]: Without dead ends: 169 [2022-10-15 20:33:51,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-15 20:33:51,455 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 80 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:33:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-15 20:33:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-10-15 20:33:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 153 states have (on average 1.0980392156862746) internal successors, (168), 154 states have internal predecessors, (168), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 20:33:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2022-10-15 20:33:51,485 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 143 [2022-10-15 20:33:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:51,485 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2022-10-15 20:33:51,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 20:33:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2022-10-15 20:33:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-15 20:33:51,491 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:33:51,491 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 20:33:51,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-10-15 20:33:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:33:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash -329528818, now seen corresponding path program 2 times [2022-10-15 20:33:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:33:51,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068018063] [2022-10-15 20:33:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:33:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:33:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 20:33:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 20:33:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 20:33:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 20:33:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 20:33:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 20:33:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 20:33:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-15 20:33:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 20:33:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-15 20:33:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 20:33:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-10-15 20:33:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-10-15 20:33:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:33:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-10-15 20:33:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:33:52,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068018063] [2022-10-15 20:33:52,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068018063] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:33:52,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677887045] [2022-10-15 20:33:52,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:33:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:33:52,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:33:52,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 20:33:52,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:33:52,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:33:52,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:33:52,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:33:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-10-15 20:33:52,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:33:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-10-15 20:33:52,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677887045] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:33:52,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:33:52,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 3] total 10 [2022-10-15 20:33:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20178388] [2022-10-15 20:33:52,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:33:52,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 20:33:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:33:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 20:33:52,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 20:33:52,926 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-10-15 20:33:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:33:53,105 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2022-10-15 20:33:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 20:33:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 154 [2022-10-15 20:33:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:33:53,107 INFO L225 Difference]: With dead ends: 169 [2022-10-15 20:33:53,107 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 20:33:53,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-10-15 20:33:53,112 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 318 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:33:53,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 40 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:33:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 20:33:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 20:33:53,114 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-15 20:33:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 20:33:53,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2022-10-15 20:33:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:33:53,115 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 20:33:53,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-10-15 20:33:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 20:33:53,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 20:33:53,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-10-15 20:33:53,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-10-15 20:33:53,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-10-15 20:33:53,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-10-15 20:33:53,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-10-15 20:33:53,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-10-15 20:33:53,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-10-15 20:33:53,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-10-15 20:33:53,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-10-15 20:33:53,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-10-15 20:33:53,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-10-15 20:33:53,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-10-15 20:33:53,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-10-15 20:33:53,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-10-15 20:33:53,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-10-15 20:33:53,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-10-15 20:33:53,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-10-15 20:33:53,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-10-15 20:33:53,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-10-15 20:33:53,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-10-15 20:33:53,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-10-15 20:33:53,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-10-15 20:33:53,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-10-15 20:33:53,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-10-15 20:33:53,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-10-15 20:33:53,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-10-15 20:33:53,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-10-15 20:33:53,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-10-15 20:33:53,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 20:33:53,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:33:53,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 20:33:53,743 INFO L902 garLoopResultBuilder]: At program point ReadFromPortENTRY(lines 12 16) the Hoare annotation is: true [2022-10-15 20:33:53,743 INFO L899 garLoopResultBuilder]: For program point ReadFromPortFINAL(lines 12 16) no Hoare annotation was computed. [2022-10-15 20:33:53,744 INFO L899 garLoopResultBuilder]: For program point ReadFromPortEXIT(lines 12 16) no Hoare annotation was computed. [2022-10-15 20:33:53,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 76) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 77) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 77) no Hoare annotation was computed. [2022-10-15 20:33:53,745 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,746 INFO L899 garLoopResultBuilder]: For program point L36-5(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,746 INFO L899 garLoopResultBuilder]: For program point L36-6(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,746 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 20:33:53,746 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,746 INFO L895 garLoopResultBuilder]: At program point L36-7(lines 36 77) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,746 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point L36-8(lines 36 77) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point L61-2(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,747 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point L45-2(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 79) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point L45-3(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,748 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point L79-3(line 79) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,749 INFO L899 garLoopResultBuilder]: For program point L79-4(line 79) no Hoare annotation was computed. [2022-10-15 20:33:53,750 INFO L895 garLoopResultBuilder]: At program point L79-5(lines 79 82) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,750 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,750 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 24999) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,750 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,750 INFO L899 garLoopResultBuilder]: For program point L5(lines 5 7) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,751 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-10-15 20:33:53,752 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-10-15 20:33:53,753 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 39 46) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 24999) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,753 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-10-15 20:33:53,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 79) no Hoare annotation was computed. [2022-10-15 20:33:53,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 56) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 56) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 24999) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,755 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,756 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 83) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 83) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,757 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 66) no Hoare annotation was computed. [2022-10-15 20:33:53,758 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 59 66) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (<= ~SIZE~0 99999)) (.cse2 (= ~SIZE~0 (* (div ~SIZE~0 4) 4))) (.cse3 (<= ~MAX~0 100000))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 24999) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3))) [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L895 garLoopResultBuilder]: At program point L84(lines 22 85) the Hoare annotation is: (<= ~MAX~0 100000) [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point L51-2(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2022-10-15 20:33:53,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-10-15 20:33:53,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 20:33:53,760 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-10-15 20:33:53,764 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:33:53,767 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 20:33:53,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:33:53 BoogieIcfgContainer [2022-10-15 20:33:53,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 20:33:53,789 INFO L158 Benchmark]: Toolchain (without parser) took 15673.23ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 125.3MB in the beginning and 117.4MB in the end (delta: 7.9MB). Peak memory consumption was 119.9MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,789 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 120.4MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 20:33:53,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.31ms. Allocated memory is still 151.0MB. Free memory was 125.1MB in the beginning and 114.4MB in the end (delta: 10.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.49ms. Allocated memory is still 151.0MB. Free memory was 114.4MB in the beginning and 112.5MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,790 INFO L158 Benchmark]: Boogie Preprocessor took 37.25ms. Allocated memory is still 151.0MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,791 INFO L158 Benchmark]: RCFGBuilder took 630.17ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 131.1MB in the end (delta: -20.1MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,791 INFO L158 Benchmark]: TraceAbstraction took 14603.32ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 130.1MB in the beginning and 117.4MB in the end (delta: 12.7MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. [2022-10-15 20:33:53,793 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.26ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 120.4MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.31ms. Allocated memory is still 151.0MB. Free memory was 125.1MB in the beginning and 114.4MB in the end (delta: 10.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.49ms. Allocated memory is still 151.0MB. Free memory was 114.4MB in the beginning and 112.5MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.25ms. Allocated memory is still 151.0MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.17ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 131.1MB in the end (delta: -20.1MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14603.32ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 130.1MB in the beginning and 117.4MB in the end (delta: 12.7MB). Peak memory consumption was 123.3MB. 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 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: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: 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: 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: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: 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, 38 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 13, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2509 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2474 mSDsluCounter, 2379 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1601 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3111 IncrementalHoareTripleChecker+Invalid, 3528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 778 mSDtfsCounter, 3111 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1090 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=10, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 24 PreInvPairs, 60 NumberOfFragments, 262 HoareAnnotationTreeSize, 24 FomulaSimplifications, 332 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1820 ConstructedInterpolants, 0 QuantifiedInterpolants, 6862 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 2466/2903 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 38 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: MAX <= 100000 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((1 <= i && 2 <= SIZE) && SIZE <= 99999) && SIZE == SIZE / 4 * 4) && MAX <= 100000) || ((((i == 0 && 2 <= SIZE) && SIZE <= 99999) && SIZE == SIZE / 4 * 4) && MAX <= 100000) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((2 <= SIZE && 2 <= i) && SIZE <= 99999) && SIZE == SIZE / 4 * 4) && MAX <= 100000) || ((((2 <= SIZE && i == 1) && SIZE <= 99999) && SIZE == SIZE / 4 * 4) && MAX <= 100000) RESULT: Ultimate proved your program to be correct! [2022-10-15 20:33:53,846 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...