/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-examples/sorting_bubblesort_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 20:10:27,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 20:10:27,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 20:10:28,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 20:10:28,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 20:10:28,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 20:10:28,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 20:10:28,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 20:10:28,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 20:10:28,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 20:10:28,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 20:10:28,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 20:10:28,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 20:10:28,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 20:10:28,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 20:10:28,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 20:10:28,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 20:10:28,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 20:10:28,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 20:10:28,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 20:10:28,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 20:10:28,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 20:10:28,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 20:10:28,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 20:10:28,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 20:10:28,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 20:10:28,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 20:10:28,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 20:10:28,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 20:10:28,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 20:10:28,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 20:10:28,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 20:10:28,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 20:10:28,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 20:10:28,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 20:10:28,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 20:10:28,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 20:10:28,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 20:10:28,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 20:10:28,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 20:10:28,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 20:10:28,123 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:10:28,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 20:10:28,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 20:10:28,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 20:10:28,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 20:10:28,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 20:10:28,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 20:10:28,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 20:10:28,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 20:10:28,186 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 20:10:28,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 20:10:28,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 20:10:28,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 20:10:28,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 20:10:28,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 20:10:28,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 20:10:28,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 20:10:28,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 20:10:28,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 20:10:28,189 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 20:10:28,189 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 20:10:28,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 20:10:28,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 20:10:28,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 20:10:28,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 20:10:28,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 20:10:28,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 20:10:28,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:10:28,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 20:10:28,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 20:10:28,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 20:10:28,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 20:10:28,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 20:10:28,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 20:10:28,193 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:10:28,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 20:10:28,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 20:10:28,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 20:10:28,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 20:10:28,601 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 20:10:28,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sorting_bubblesort_ground-1.i [2022-10-15 20:10:28,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5908b075/e48463c80ed44f7b9c0649b73427d862/FLAGa742a65a9 [2022-10-15 20:10:29,382 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 20:10:29,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-1.i [2022-10-15 20:10:29,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5908b075/e48463c80ed44f7b9c0649b73427d862/FLAGa742a65a9 [2022-10-15 20:10:29,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5908b075/e48463c80ed44f7b9c0649b73427d862 [2022-10-15 20:10:29,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 20:10:29,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 20:10:29,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 20:10:29,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 20:10:29,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 20:10:29,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:10:29" (1/1) ... [2022-10-15 20:10:29,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac389dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:29, skipping insertion in model container [2022-10-15 20:10:29,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:10:29" (1/1) ... [2022-10-15 20:10:29,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 20:10:29,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 20:10:30,013 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-examples/sorting_bubblesort_ground-1.i[820,833] [2022-10-15 20:10:30,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:10:30,046 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 20:10:30,061 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-examples/sorting_bubblesort_ground-1.i[820,833] [2022-10-15 20:10:30,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:10:30,089 INFO L208 MainTranslator]: Completed translation [2022-10-15 20:10:30,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30 WrapperNode [2022-10-15 20:10:30,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 20:10:30,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 20:10:30,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 20:10:30,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 20:10:30,102 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:10:30" (1/1) ... [2022-10-15 20:10:30,111 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:10:30" (1/1) ... [2022-10-15 20:10:30,138 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-10-15 20:10:30,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 20:10:30,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 20:10:30,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 20:10:30,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 20:10:30,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,168 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 20:10:30,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 20:10:30,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 20:10:30,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 20:10:30,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (1/1) ... [2022-10-15 20:10:30,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:10:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:30,220 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:10:30,245 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:10:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 20:10:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 20:10:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 20:10:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 20:10:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 20:10:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 20:10:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 20:10:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 20:10:30,371 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 20:10:30,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 20:10:30,582 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 20:10:30,591 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 20:10:30,591 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-15 20:10:30,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:10:30 BoogieIcfgContainer [2022-10-15 20:10:30,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 20:10:30,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 20:10:30,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 20:10:30,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 20:10:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:10:29" (1/3) ... [2022-10-15 20:10:30,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc10d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:10:30, skipping insertion in model container [2022-10-15 20:10:30,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:10:30" (2/3) ... [2022-10-15 20:10:30,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc10d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:10:30, skipping insertion in model container [2022-10-15 20:10:30,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:10:30" (3/3) ... [2022-10-15 20:10:30,605 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-1.i [2022-10-15 20:10:30,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 20:10:30,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-15 20:10:30,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 20:10:30,785 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;@25809100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 20:10:30,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-15 20:10:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 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:10:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 20:10:30,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:30,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 20:10:30,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2022-10-15 20:10:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:30,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146528603] [2022-10-15 20:10:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:31,218 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:10:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:31,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146528603] [2022-10-15 20:10:31,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146528603] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:31,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:31,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999395785] [2022-10-15 20:10:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:31,284 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 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) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:10:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:31,415 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-10-15 20:10:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-10-15 20:10:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:31,433 INFO L225 Difference]: With dead ends: 102 [2022-10-15 20:10:31,433 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 20:10:31,441 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:10:31,450 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:31,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:10:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 20:10:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-15 20:10:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.6) internal successors, (56), 50 states have internal predecessors, (56), 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:10:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-10-15 20:10:31,519 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 5 [2022-10-15 20:10:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:31,520 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-10-15 20:10:31,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:10:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-10-15 20:10:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 20:10:31,524 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:31,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-10-15 20:10:31,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 20:10:31,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2022-10-15 20:10:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:31,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915377613] [2022-10-15 20:10:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 20:10:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915377613] [2022-10-15 20:10:31,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915377613] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:31,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:31,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976234708] [2022-10-15 20:10:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:31,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:31,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:31,741 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:10:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:31,782 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-10-15 20:10:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-10-15 20:10:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:31,785 INFO L225 Difference]: With dead ends: 51 [2022-10-15 20:10:31,785 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 20:10:31,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:10:31,787 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:31,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 20:10:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 20:10:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 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:10:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-15 20:10:31,807 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 9 [2022-10-15 20:10:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:31,809 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-15 20:10:31,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:10:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-15 20:10:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 20:10:31,811 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:31,811 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2022-10-15 20:10:31,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 20:10:31,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2022-10-15 20:10:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:31,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450697844] [2022-10-15 20:10:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:10:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:31,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450697844] [2022-10-15 20:10:31,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450697844] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:31,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767422229] [2022-10-15 20:10:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:31,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:31,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:31,964 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:10:31,966 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:10:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:32,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:10:32,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:10:32,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:32,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767422229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:32,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:32,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 20:10:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169509331] [2022-10-15 20:10:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:32,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:10:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:10:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:10:32,152 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:10:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:32,207 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-10-15 20:10:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:10:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-10-15 20:10:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:32,210 INFO L225 Difference]: With dead ends: 50 [2022-10-15 20:10:32,210 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 20:10:32,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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:10:32,213 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:32,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 91 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 20:10:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-10-15 20:10:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.59375) internal successors, (51), 45 states have internal predecessors, (51), 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:10:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-10-15 20:10:32,225 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2022-10-15 20:10:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:32,226 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-10-15 20:10:32,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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:10:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-10-15 20:10:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 20:10:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:32,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:32,276 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:10:32,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:32,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1713503061, now seen corresponding path program 1 times [2022-10-15 20:10:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:32,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554414001] [2022-10-15 20:10:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:10:32,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:32,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554414001] [2022-10-15 20:10:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554414001] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014694912] [2022-10-15 20:10:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:32,616 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:10:32,634 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:10:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:32,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:32,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 20:10:32,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:32,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014694912] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:32,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:32,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 20:10:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814499934] [2022-10-15 20:10:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:32,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:32,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:32,688 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:32,747 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-10-15 20:10:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 20:10:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:32,749 INFO L225 Difference]: With dead ends: 94 [2022-10-15 20:10:32,749 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 20:10:32,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:32,751 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:32,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 20:10:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-10-15 20:10:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 54 states have internal predecessors, (64), 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:10:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-10-15 20:10:32,762 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 11 [2022-10-15 20:10:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:32,764 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-10-15 20:10:32,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-10-15 20:10:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 20:10:32,765 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:32,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:32,804 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:10:32,979 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,SelfDestructingSolverStorable3 [2022-10-15 20:10:32,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1579017860, now seen corresponding path program 1 times [2022-10-15 20:10:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:32,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420322084] [2022-10-15 20:10:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:10:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420322084] [2022-10-15 20:10:33,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420322084] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579263868] [2022-10-15 20:10:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:33,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:33,103 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:10:33,117 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:10:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:33,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:33,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 20:10:33,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:33,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579263868] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:33,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:33,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 20:10:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689563705] [2022-10-15 20:10:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:33,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:33,182 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:33,196 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-10-15 20:10:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:33,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 20:10:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:33,197 INFO L225 Difference]: With dead ends: 94 [2022-10-15 20:10:33,198 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 20:10:33,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:33,200 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:33,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 20:10:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-10-15 20:10:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 62 states have internal predecessors, (78), 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:10:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2022-10-15 20:10:33,209 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 12 [2022-10-15 20:10:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:33,210 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2022-10-15 20:10:33,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-10-15 20:10:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 20:10:33,211 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:33,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:33,246 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:10:33,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:33,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1578987267, now seen corresponding path program 1 times [2022-10-15 20:10:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225800213] [2022-10-15 20:10:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:10:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225800213] [2022-10-15 20:10:33,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225800213] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:33,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914455453] [2022-10-15 20:10:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:33,485 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:10:33,526 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:10:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:33,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:33,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 20:10:33,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:33,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914455453] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:33,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:33,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 20:10:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856304597] [2022-10-15 20:10:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:33,586 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:33,611 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-10-15 20:10:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:33,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 20:10:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:33,612 INFO L225 Difference]: With dead ends: 64 [2022-10-15 20:10:33,613 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 20:10:33,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:33,614 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:33,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 20:10:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-10-15 20:10:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 58 states have internal predecessors, (69), 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:10:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-10-15 20:10:33,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 12 [2022-10-15 20:10:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:33,623 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-10-15 20:10:33,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 20:10:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-10-15 20:10:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 20:10:33,624 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:33,624 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:33,662 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:10:33,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:33,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1446466052, now seen corresponding path program 1 times [2022-10-15 20:10:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:33,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458547616] [2022-10-15 20:10:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458547616] [2022-10-15 20:10:33,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458547616] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:33,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830967632] [2022-10-15 20:10:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:33,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:33,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:33,948 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:10:33,971 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:10:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:34,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:34,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:34,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:34,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830967632] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:34,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:34,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 20:10:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381016981] [2022-10-15 20:10:34,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:34,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:34,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,027 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:10:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:34,050 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-10-15 20:10:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 17 [2022-10-15 20:10:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:34,052 INFO L225 Difference]: With dead ends: 59 [2022-10-15 20:10:34,052 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 20:10:34,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,053 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:34,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 20:10:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2022-10-15 20:10:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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:10:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-10-15 20:10:34,060 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 17 [2022-10-15 20:10:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:34,061 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-10-15 20:10:34,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:10:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-10-15 20:10:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 20:10:34,062 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:34,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:34,102 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:10:34,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:34,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -265412110, now seen corresponding path program 1 times [2022-10-15 20:10:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:34,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683569681] [2022-10-15 20:10:34,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683569681] [2022-10-15 20:10:34,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683569681] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:34,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363773768] [2022-10-15 20:10:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:34,334 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:10:34,363 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:10:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:34,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:34,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 20:10:34,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:34,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363773768] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:34,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:34,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 20:10:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194024008] [2022-10-15 20:10:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:34,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,406 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:10:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:34,427 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-10-15 20:10:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-10-15 20:10:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:34,428 INFO L225 Difference]: With dead ends: 63 [2022-10-15 20:10:34,428 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 20:10:34,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,430 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:34,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 20:10:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-10-15 20:10:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 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:10:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-10-15 20:10:34,437 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 20 [2022-10-15 20:10:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:34,438 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-10-15 20:10:34,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:10:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-10-15 20:10:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 20:10:34,439 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:34,439 INFO L195 NwaCegarLoop]: trace histogram [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:10:34,470 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:10:34,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:34,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 362159291, now seen corresponding path program 1 times [2022-10-15 20:10:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:34,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598318041] [2022-10-15 20:10:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598318041] [2022-10-15 20:10:34,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598318041] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130374310] [2022-10-15 20:10:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:34,739 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:10:34,760 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:10:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:34,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 20:10:34,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 20:10:34,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:34,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130374310] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:34,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:34,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 20:10:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471439770] [2022-10-15 20:10:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:34,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:34,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:34,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,829 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:10:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:34,861 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-10-15 20:10:34,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:34,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:10:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:34,863 INFO L225 Difference]: With dead ends: 63 [2022-10-15 20:10:34,863 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 20:10:34,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:34,868 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:34,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 69 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 20:10:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2022-10-15 20:10:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 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:10:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-10-15 20:10:34,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 21 [2022-10-15 20:10:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:34,887 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-10-15 20:10:34,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:10:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-10-15 20:10:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 20:10:34,889 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:34,889 INFO L195 NwaCegarLoop]: trace histogram [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:10:34,932 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:10:35,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:35,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash 129705498, now seen corresponding path program 1 times [2022-10-15 20:10:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325569498] [2022-10-15 20:10:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:35,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325569498] [2022-10-15 20:10:35,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325569498] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:35,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513894521] [2022-10-15 20:10:35,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:35,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:35,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:10:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 20:10:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:35,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:10:35,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:35,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:10:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:35,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513894521] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:10:35,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:10:35,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 20:10:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755200005] [2022-10-15 20:10:35,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:10:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 20:10:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 20:10:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:10:35,289 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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:10:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:35,333 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2022-10-15 20:10:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 20:10:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 24 [2022-10-15 20:10:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:35,334 INFO L225 Difference]: With dead ends: 99 [2022-10-15 20:10:35,334 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 20:10:35,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-15 20:10:35,336 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:35,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 20:10:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-15 20:10:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 56 states have internal predecessors, (64), 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:10:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-10-15 20:10:35,342 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 24 [2022-10-15 20:10:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:35,342 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-10-15 20:10:35,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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:10:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-10-15 20:10:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 20:10:35,344 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:35,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 20:10:35,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -37875678, now seen corresponding path program 2 times [2022-10-15 20:10:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508491280] [2022-10-15 20:10:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 20:10:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508491280] [2022-10-15 20:10:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508491280] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602064715] [2022-10-15 20:10:35,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:10:35,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:35,626 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:10:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 20:10:35,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:10:35,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:10:35,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 20:10:35,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-15 20:10:35,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602064715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:35,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:35,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-10-15 20:10:35,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398859366] [2022-10-15 20:10:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:35,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:10:35,699 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:35,732 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-10-15 20:10:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:35,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 32 [2022-10-15 20:10:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:35,734 INFO L225 Difference]: With dead ends: 96 [2022-10-15 20:10:35,734 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 20:10:35,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 20:10:35,735 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:35,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 100 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 20:10:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2022-10-15 20:10:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.25) internal successors, (65), 57 states have internal predecessors, (65), 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:10:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-10-15 20:10:35,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 32 [2022-10-15 20:10:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:35,743 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-10-15 20:10:35,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-10-15 20:10:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 20:10:35,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:35,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:35,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:35,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:35,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2037306074, now seen corresponding path program 1 times [2022-10-15 20:10:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:35,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314084281] [2022-10-15 20:10:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:35,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 20:10:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314084281] [2022-10-15 20:10:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314084281] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:36,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986076985] [2022-10-15 20:10:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:36,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:10:36,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 20:10:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:36,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 20:10:36,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:36,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:10:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 20:10:36,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986076985] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:10:36,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:10:36,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2022-10-15 20:10:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537696504] [2022-10-15 20:10:36,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:10:36,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 20:10:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:36,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 20:10:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-10-15 20:10:36,342 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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:10:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:36,546 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-10-15 20:10:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 20:10:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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 34 [2022-10-15 20:10:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:36,548 INFO L225 Difference]: With dead ends: 144 [2022-10-15 20:10:36,548 INFO L226 Difference]: Without dead ends: 101 [2022-10-15 20:10:36,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-10-15 20:10:36,550 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:36,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 291 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:10:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-15 20:10:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-10-15 20:10:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 86 states have internal predecessors, (95), 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:10:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-10-15 20:10:36,557 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 34 [2022-10-15 20:10:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:36,557 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-10-15 20:10:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 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:10:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-10-15 20:10:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 20:10:36,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:36,559 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:36,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:36,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-15 20:10:36,774 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -422076987, now seen corresponding path program 2 times [2022-10-15 20:10:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:36,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662963459] [2022-10-15 20:10:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-10-15 20:10:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662963459] [2022-10-15 20:10:36,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662963459] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:36,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:36,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541519531] [2022-10-15 20:10:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:36,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:36,867 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:10:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:36,887 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-10-15 20:10:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 56 [2022-10-15 20:10:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:36,891 INFO L225 Difference]: With dead ends: 87 [2022-10-15 20:10:36,891 INFO L226 Difference]: Without dead ends: 86 [2022-10-15 20:10:36,892 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:10:36,893 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:36,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-15 20:10:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-10-15 20:10:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 85 states have internal predecessors, (94), 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:10:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-10-15 20:10:36,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 56 [2022-10-15 20:10:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:36,900 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-10-15 20:10:36,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:10:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-10-15 20:10:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 20:10:36,908 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:36,908 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:36,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 20:10:36,909 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -199484577, now seen corresponding path program 1 times [2022-10-15 20:10:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:36,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453731805] [2022-10-15 20:10:36,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:36,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-15 20:10:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453731805] [2022-10-15 20:10:37,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453731805] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:37,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454608510] [2022-10-15 20:10:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:37,081 INFO L229 MonitoredProcess]: Starting monitored process 12 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:10:37,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 20:10:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:37,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 20:10:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 20:10:37,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:10:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 20:10:37,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454608510] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:10:37,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:10:37,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 35 [2022-10-15 20:10:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393491286] [2022-10-15 20:10:37,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:10:37,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-15 20:10:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:37,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-15 20:10:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 20:10:37,674 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 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:10:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:38,049 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2022-10-15 20:10:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-15 20:10:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 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 57 [2022-10-15 20:10:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:38,052 INFO L225 Difference]: With dead ends: 203 [2022-10-15 20:10:38,052 INFO L226 Difference]: Without dead ends: 148 [2022-10-15 20:10:38,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1720, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 20:10:38,057 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 163 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:38,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 182 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:10:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-15 20:10:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-10-15 20:10:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 133 states have internal predecessors, (144), 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:10:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2022-10-15 20:10:38,071 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 57 [2022-10-15 20:10:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:38,071 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2022-10-15 20:10:38,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 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:10:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-10-15 20:10:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-15 20:10:38,076 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:38,077 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:38,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 20:10:38,292 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 460642256, now seen corresponding path program 2 times [2022-10-15 20:10:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370293326] [2022-10-15 20:10:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-10-15 20:10:38,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:38,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370293326] [2022-10-15 20:10:38,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370293326] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:38,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838391643] [2022-10-15 20:10:38,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:10:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:38,495 INFO L229 MonitoredProcess]: Starting monitored process 13 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:10:38,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 20:10:38,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:10:38,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:10:38,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:10:38,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-10-15 20:10:38,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:38,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838391643] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:38,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:38,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-10-15 20:10:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956834490] [2022-10-15 20:10:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 20:10:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 20:10:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 20:10:38,597 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:10:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:38,668 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-10-15 20:10:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:10:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 95 [2022-10-15 20:10:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:38,670 INFO L225 Difference]: With dead ends: 146 [2022-10-15 20:10:38,670 INFO L226 Difference]: Without dead ends: 145 [2022-10-15 20:10:38,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-10-15 20:10:38,671 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:38,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-10-15 20:10:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2022-10-15 20:10:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 139 states have internal predecessors, (151), 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:10:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2022-10-15 20:10:38,680 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 95 [2022-10-15 20:10:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:38,680 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2022-10-15 20:10:38,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:10:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-10-15 20:10:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-15 20:10:38,681 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:38,682 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:38,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:38,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 20:10:38,896 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 573052645, now seen corresponding path program 1 times [2022-10-15 20:10:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:38,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558545228] [2022-10-15 20:10:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-10-15 20:10:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:39,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558545228] [2022-10-15 20:10:39,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558545228] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:39,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:39,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136940571] [2022-10-15 20:10:39,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:39,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:39,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:39,055 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:10:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:39,088 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-10-15 20:10:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:39,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 98 [2022-10-15 20:10:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:39,090 INFO L225 Difference]: With dead ends: 145 [2022-10-15 20:10:39,090 INFO L226 Difference]: Without dead ends: 143 [2022-10-15 20:10:39,090 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:10:39,091 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:39,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-10-15 20:10:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-10-15 20:10:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 142 states have internal predecessors, (154), 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:10:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2022-10-15 20:10:39,100 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 98 [2022-10-15 20:10:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:39,100 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2022-10-15 20:10:39,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:10:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2022-10-15 20:10:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 20:10:39,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:39,102 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:39,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 20:10:39,102 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -683516503, now seen corresponding path program 1 times [2022-10-15 20:10:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:39,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487018930] [2022-10-15 20:10:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-10-15 20:10:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487018930] [2022-10-15 20:10:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487018930] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:39,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:39,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:10:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364772371] [2022-10-15 20:10:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:39,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:10:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:10:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:10:39,205 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:10:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:39,220 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-10-15 20:10:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:10:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 101 [2022-10-15 20:10:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:39,222 INFO L225 Difference]: With dead ends: 143 [2022-10-15 20:10:39,222 INFO L226 Difference]: Without dead ends: 142 [2022-10-15 20:10:39,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:10:39,223 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:39,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-10-15 20:10:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-10-15 20:10:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.108695652173913) internal successors, (153), 141 states have internal predecessors, (153), 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:10:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2022-10-15 20:10:39,233 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 101 [2022-10-15 20:10:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:39,233 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2022-10-15 20:10:39,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:10:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-10-15 20:10:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-15 20:10:39,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:39,234 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:39,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 20:10:39,235 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 285824996, now seen corresponding path program 1 times [2022-10-15 20:10:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:39,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749595050] [2022-10-15 20:10:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-10-15 20:10:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:39,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749595050] [2022-10-15 20:10:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749595050] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098803014] [2022-10-15 20:10:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:39,416 INFO L229 MonitoredProcess]: Starting monitored process 14 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:10:39,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 20:10:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:39,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-15 20:10:39,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-15 20:10:40,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:10:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-15 20:10:41,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098803014] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:10:41,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:10:41,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 33, 33] total 67 [2022-10-15 20:10:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717271217] [2022-10-15 20:10:41,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:10:41,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-15 20:10:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-15 20:10:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1062, Invalid=3360, Unknown=0, NotChecked=0, Total=4422 [2022-10-15 20:10:41,187 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 67 states, 67 states have (on average 2.7313432835820897) internal successors, (183), 67 states have internal predecessors, (183), 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:10:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:42,283 INFO L93 Difference]: Finished difference Result 300 states and 339 transitions. [2022-10-15 20:10:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-10-15 20:10:42,284 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.7313432835820897) internal successors, (183), 67 states have internal predecessors, (183), 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 102 [2022-10-15 20:10:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:42,286 INFO L225 Difference]: With dead ends: 300 [2022-10-15 20:10:42,286 INFO L226 Difference]: Without dead ends: 221 [2022-10-15 20:10:42,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2537, Invalid=6969, Unknown=0, NotChecked=0, Total=9506 [2022-10-15 20:10:42,291 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 192 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:42,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 652 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 20:10:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-15 20:10:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 209. [2022-10-15 20:10:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.0731707317073171) internal successors, (220), 208 states have internal predecessors, (220), 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:10:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2022-10-15 20:10:42,301 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 102 [2022-10-15 20:10:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:42,302 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2022-10-15 20:10:42,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.7313432835820897) internal successors, (183), 67 states have internal predecessors, (183), 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:10:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2022-10-15 20:10:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-10-15 20:10:42,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:42,304 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:42,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:42,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 20:10:42,519 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2039167471, now seen corresponding path program 1 times [2022-10-15 20:10:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:42,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762373370] [2022-10-15 20:10:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1915 trivial. 0 not checked. [2022-10-15 20:10:42,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:42,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762373370] [2022-10-15 20:10:42,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762373370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:42,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:42,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002193509] [2022-10-15 20:10:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:42,727 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:10:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:42,751 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2022-10-15 20:10:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:42,752 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), 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 169 [2022-10-15 20:10:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:42,753 INFO L225 Difference]: With dead ends: 209 [2022-10-15 20:10:42,753 INFO L226 Difference]: Without dead ends: 208 [2022-10-15 20:10:42,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:10:42,755 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:42,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-10-15 20:10:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-10-15 20:10:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 205 states have (on average 1.0682926829268293) internal successors, (219), 207 states have internal predecessors, (219), 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:10:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2022-10-15 20:10:42,765 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 169 [2022-10-15 20:10:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:42,766 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2022-10-15 20:10:42,766 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), 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:10:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2022-10-15 20:10:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-10-15 20:10:42,768 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:42,768 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:42,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 20:10:42,768 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1210317979, now seen corresponding path program 1 times [2022-10-15 20:10:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166449923] [2022-10-15 20:10:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked. [2022-10-15 20:10:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166449923] [2022-10-15 20:10:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166449923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:42,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:10:42,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:10:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332466554] [2022-10-15 20:10:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:42,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:10:42,971 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:42,995 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-10-15 20:10:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 170 [2022-10-15 20:10:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:42,997 INFO L225 Difference]: With dead ends: 208 [2022-10-15 20:10:42,998 INFO L226 Difference]: Without dead ends: 206 [2022-10-15 20:10:42,998 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:10:42,999 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:42,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-15 20:10:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2022-10-15 20:10:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.0603015075376885) internal successors, (211), 199 states have internal predecessors, (211), 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:10:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 211 transitions. [2022-10-15 20:10:43,009 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 211 transitions. Word has length 170 [2022-10-15 20:10:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:43,009 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 211 transitions. [2022-10-15 20:10:43,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 211 transitions. [2022-10-15 20:10:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-10-15 20:10:43,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:43,012 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:43,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 20:10:43,013 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -774748209, now seen corresponding path program 1 times [2022-10-15 20:10:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:43,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978071215] [2022-10-15 20:10:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2022-10-15 20:10:43,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978071215] [2022-10-15 20:10:43,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978071215] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951365382] [2022-10-15 20:10:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:43,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:43,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:43,341 INFO L229 MonitoredProcess]: Starting monitored process 15 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:10:43,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 20:10:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:43,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-15 20:10:43,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 20:10:45,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:10:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 20:10:49,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951365382] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:10:49,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:10:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 65, 65] total 132 [2022-10-15 20:10:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815118033] [2022-10-15 20:10:49,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:10:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-10-15 20:10:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:49,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-10-15 20:10:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4174, Invalid=13118, Unknown=0, NotChecked=0, Total=17292 [2022-10-15 20:10:49,287 INFO L87 Difference]: Start difference. First operand 200 states and 211 transitions. Second operand has 132 states, 132 states have (on average 2.3106060606060606) internal successors, (305), 132 states have internal predecessors, (305), 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:10:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:52,800 INFO L93 Difference]: Finished difference Result 431 states and 490 transitions. [2022-10-15 20:10:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-10-15 20:10:52,801 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.3106060606060606) internal successors, (305), 132 states have internal predecessors, (305), 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 172 [2022-10-15 20:10:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:52,803 INFO L225 Difference]: With dead ends: 431 [2022-10-15 20:10:52,803 INFO L226 Difference]: Without dead ends: 358 [2022-10-15 20:10:52,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7912 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10189, Invalid=27253, Unknown=0, NotChecked=0, Total=37442 [2022-10-15 20:10:52,817 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 677 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:52,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 155 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 20:10:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-10-15 20:10:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 344. [2022-10-15 20:10:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.0408163265306123) internal successors, (357), 343 states have internal predecessors, (357), 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:10:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 357 transitions. [2022-10-15 20:10:52,831 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 357 transitions. Word has length 172 [2022-10-15 20:10:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:52,832 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 357 transitions. [2022-10-15 20:10:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.3106060606060606) internal successors, (305), 132 states have internal predecessors, (305), 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:10:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 357 transitions. [2022-10-15 20:10:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-10-15 20:10:52,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:10:52,838 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:52,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:53,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:53,054 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-15 20:10:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:10:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -750578658, now seen corresponding path program 2 times [2022-10-15 20:10:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:10:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666147127] [2022-10-15 20:10:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:10:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:10:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:10:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7927 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 7886 trivial. 0 not checked. [2022-10-15 20:10:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:10:53,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666147127] [2022-10-15 20:10:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666147127] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:10:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239291501] [2022-10-15 20:10:53,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 20:10:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:10:53,649 INFO L229 MonitoredProcess]: Starting monitored process 16 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:10:53,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 20:10:53,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 20:10:53,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 20:10:53,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 20:10:53,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:10:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7927 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7920 trivial. 0 not checked. [2022-10-15 20:10:53,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:10:53,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239291501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:10:53,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:10:53,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 20:10:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128150494] [2022-10-15 20:10:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:10:53,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:10:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:10:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:10:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-15 20:10:53,841 INFO L87 Difference]: Start difference. First operand 344 states and 357 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:10:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:10:53,868 INFO L93 Difference]: Finished difference Result 344 states and 357 transitions. [2022-10-15 20:10:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:10:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 306 [2022-10-15 20:10:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:10:53,870 INFO L225 Difference]: With dead ends: 344 [2022-10-15 20:10:53,870 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 20:10:53,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:10:53,875 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:10:53,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:10:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 20:10:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 20:10:53,877 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:10:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 20:10:53,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2022-10-15 20:10:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:10:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 20:10:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:10:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 20:10:53,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 20:10:53,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-10-15 20:10:53,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-10-15 20:10:53,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-10-15 20:10:53,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-10-15 20:10:53,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-10-15 20:10:53,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-10-15 20:10:53,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-10-15 20:10:53,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-10-15 20:10:53,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-10-15 20:10:53,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-10-15 20:10:53,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-10-15 20:10:53,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-10-15 20:10:53,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-10-15 20:10:53,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-10-15 20:10:53,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-10-15 20:10:53,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-10-15 20:10:53,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 20:10:54,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:10:54,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 20:10:54,385 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-10-15 20:10:54,385 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2022-10-15 20:10:54,385 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2022-10-15 20:10:54,386 INFO L899 garLoopResultBuilder]: For program point L19-4(line 19) no Hoare annotation was computed. [2022-10-15 20:10:54,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-10-15 20:10:54,386 INFO L895 garLoopResultBuilder]: At program point L19-5(lines 19 22) the Hoare annotation is: (or (<= 1 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0)) [2022-10-15 20:10:54,386 INFO L899 garLoopResultBuilder]: For program point L19-6(lines 19 22) no Hoare annotation was computed. [2022-10-15 20:10:54,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2022-10-15 20:10:54,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-10-15 20:10:54,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 20:10:54,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 20:10:54,389 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 36) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~j~0#1|)) [2022-10-15 20:10:54,390 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 25 37) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~j~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse0) (and .cse0 (<= 1 |ULTIMATE.start_main_~swapped~0#1|)))) [2022-10-15 20:10:54,390 INFO L902 garLoopResultBuilder]: At program point L45(lines 16 46) the Hoare annotation is: true [2022-10-15 20:10:54,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 20:10:54,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-10-15 20:10:54,390 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L29-4(lines 29 34) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2022-10-15 20:10:54,391 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2022-10-15 20:10:54,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,392 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-10-15 20:10:54,392 INFO L899 garLoopResultBuilder]: For program point L31-1(line 31) no Hoare annotation was computed. [2022-10-15 20:10:54,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,393 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 44) no Hoare annotation was computed. [2022-10-15 20:10:54,393 INFO L899 garLoopResultBuilder]: For program point L40-3(line 40) no Hoare annotation was computed. [2022-10-15 20:10:54,393 INFO L899 garLoopResultBuilder]: For program point L40-4(line 40) no Hoare annotation was computed. [2022-10-15 20:10:54,393 INFO L895 garLoopResultBuilder]: At program point L40-5(lines 40 44) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|)) .cse0 (<= 1 |ULTIMATE.start_main_~y~0#1|) .cse1))) [2022-10-15 20:10:54,393 INFO L899 garLoopResultBuilder]: For program point L40-6(lines 40 44) no Hoare annotation was computed. [2022-10-15 20:10:54,394 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-10-15 20:10:54,394 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 20:10:54,395 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-10-15 20:10:54,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 31) no Hoare annotation was computed. [2022-10-15 20:10:54,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,395 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,396 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,396 INFO L899 garLoopResultBuilder]: For program point L41-4(lines 41 43) no Hoare annotation was computed. [2022-10-15 20:10:54,396 INFO L899 garLoopResultBuilder]: For program point L41-5(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,396 INFO L899 garLoopResultBuilder]: For program point L41-6(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,396 INFO L895 garLoopResultBuilder]: At program point L41-7(lines 41 43) the Hoare annotation is: (and (<= 0 (+ 2147483649 |ULTIMATE.start_main_~x~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 99999) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) [2022-10-15 20:10:54,396 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 20:10:54,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 31) no Hoare annotation was computed. [2022-10-15 20:10:54,397 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 37) no Hoare annotation was computed. [2022-10-15 20:10:54,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-10-15 20:10:54,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-10-15 20:10:54,398 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-10-15 20:10:54,398 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2022-10-15 20:10:54,398 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-10-15 20:10:54,406 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:10:54,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 20:10:54,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:10:54 BoogieIcfgContainer [2022-10-15 20:10:54,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 20:10:54,445 INFO L158 Benchmark]: Toolchain (without parser) took 24666.92ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 126.1MB in the beginning and 266.7MB in the end (delta: -140.7MB). Peak memory consumption was 150.9MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,450 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 20:10:54,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.82ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 113.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,451 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 112.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,452 INFO L158 Benchmark]: RCFGBuilder took 420.18ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 99.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,453 INFO L158 Benchmark]: TraceAbstraction took 23847.44ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 99.2MB in the beginning and 266.7MB in the end (delta: -167.5MB). Peak memory consumption was 123.6MB. Max. memory is 8.0GB. [2022-10-15 20:10:54,459 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.24ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.82ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 113.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 112.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 420.18ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 99.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 23847.44ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 99.2MB in the beginning and 266.7MB in the end (delta: -167.5MB). Peak memory consumption was 123.6MB. 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 22, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1369 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1369 mSDsluCounter, 3062 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2253 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1628 IncrementalHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 809 mSDtfsCounter, 1628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1519 GetRequests, 1079 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10228 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=21, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 138 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 86 NumberOfFragments, 76 HoareAnnotationTreeSize, 6 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 433 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2458 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2805 ConstructedInterpolants, 0 QuantifiedInterpolants, 4195 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1859 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 42 InterpolantComputations, 17 PerfectInterpolantSequences, 24241/29213 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 16 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((0 <= 2147483649 + x && 1 <= i) && x <= 99999) && 1 <= j) && 0 <= y + 2147483648 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 <= j || j == 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((1 <= i && 1 <= j) && x == 0) || (((0 <= 2147483649 + x && 1 <= i) && 1 <= y) && 1 <= j) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 <= i && 1 <= j - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (1 <= i && 1 <= j) || (1 <= j && 1 <= swapped) RESULT: Ultimate proved your program to be correct! [2022-10-15 20:10:54,535 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...