/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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 16:17:45,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 16:17:45,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 16:17:45,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 16:17:45,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 16:17:45,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 16:17:45,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 16:17:45,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 16:17:45,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 16:17:45,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 16:17:45,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 16:17:45,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 16:17:45,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 16:17:45,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 16:17:45,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 16:17:45,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 16:17:45,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 16:17:45,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 16:17:45,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 16:17:45,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 16:17:45,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 16:17:45,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 16:17:45,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 16:17:45,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 16:17:45,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 16:17:45,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 16:17:45,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 16:17:45,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 16:17:45,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 16:17:45,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 16:17:45,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 16:17:45,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 16:17:45,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 16:17:45,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 16:17:45,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 16:17:45,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 16:17:45,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 16:17:45,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 16:17:45,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 16:17:45,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 16:17:45,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 16:17:45,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 16:17:45,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 16:17:45,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 16:17:45,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 16:17:45,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 16:17:45,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 16:17:45,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 16:17:45,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 16:17:45,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 16:17:45,687 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 16:17:45,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 16:17:45,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 16:17:45,687 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 16:17:45,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 16:17:45,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 16:17:45,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 16:17:45,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 16:17:45,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 16:17:45,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 16:17:45,689 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 16:17:45,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 16:17:45,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 16:17:45,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 16:17:45,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 16:17:45,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 16:17:45,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 16:17:45,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 16:17:45,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:17:45,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 16:17:45,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 16:17:45,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 16:17:45,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 16:17:45,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 16:17:45,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 16:17:45,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 16:17:46,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 16:17:46,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 16:17:46,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 16:17:46,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 16:17:46,095 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 16:17:46,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-10-16 16:17:46,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe019b4/3e262f9bcd214efd96af21cbc061c3a9/FLAGa471aaf3b [2022-10-16 16:17:46,809 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 16:17:46,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-10-16 16:17:46,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe019b4/3e262f9bcd214efd96af21cbc061c3a9/FLAGa471aaf3b [2022-10-16 16:17:47,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe019b4/3e262f9bcd214efd96af21cbc061c3a9 [2022-10-16 16:17:47,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 16:17:47,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 16:17:47,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 16:17:47,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 16:17:47,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 16:17:47,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3937ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47, skipping insertion in model container [2022-10-16 16:17:47,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 16:17:47,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 16:17:47,506 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-10-16 16:17:47,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:17:47,568 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 16:17:47,638 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-10-16 16:17:47,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:17:47,698 INFO L208 MainTranslator]: Completed translation [2022-10-16 16:17:47,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47 WrapperNode [2022-10-16 16:17:47,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 16:17:47,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 16:17:47,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 16:17:47,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 16:17:47,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,784 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-10-16 16:17:47,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 16:17:47,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 16:17:47,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 16:17:47,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 16:17:47,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,837 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 16:17:47,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 16:17:47,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 16:17:47,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 16:17:47,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (1/1) ... [2022-10-16 16:17:47,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:17:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:17:47,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 16:17:47,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 16:17:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 16:17:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 16:17:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 16:17:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 16:17:48,092 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 16:17:48,100 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 16:17:48,697 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 16:17:48,709 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 16:17:48,710 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 16:17:48,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:17:48 BoogieIcfgContainer [2022-10-16 16:17:48,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 16:17:48,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 16:17:48,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 16:17:48,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 16:17:48,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:17:47" (1/3) ... [2022-10-16 16:17:48,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d55d93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:17:48, skipping insertion in model container [2022-10-16 16:17:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:17:47" (2/3) ... [2022-10-16 16:17:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d55d93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:17:48, skipping insertion in model container [2022-10-16 16:17:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:17:48" (3/3) ... [2022-10-16 16:17:48,725 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-10-16 16:17:48,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 16:17:48,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-16 16:17:48,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 16:17:48,832 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;@7af04543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 16:17:48,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-16 16:17:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 16:17:48,846 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:48,847 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] [2022-10-16 16:17:48,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1523339456, now seen corresponding path program 1 times [2022-10-16 16:17:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167233561] [2022-10-16 16:17:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167233561] [2022-10-16 16:17:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167233561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:49,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:49,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-16 16:17:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37566372] [2022-10-16 16:17:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:49,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 16:17:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 16:17:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 16:17:49,246 INFO L87 Difference]: Start difference. First operand has 89 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 88 states have internal predecessors, (130), 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 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:49,284 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2022-10-16 16:17:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 16:17:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2022-10-16 16:17:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:49,298 INFO L225 Difference]: With dead ends: 92 [2022-10-16 16:17:49,298 INFO L226 Difference]: Without dead ends: 84 [2022-10-16 16:17:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 16:17:49,306 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:49,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:17:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-16 16:17:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-10-16 16:17:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.5) internal successors, (108), 83 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2022-10-16 16:17:49,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 23 [2022-10-16 16:17:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:49,356 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2022-10-16 16:17:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2022-10-16 16:17:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 16:17:49,358 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:49,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 16:17:49,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1151032549, now seen corresponding path program 1 times [2022-10-16 16:17:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986134456] [2022-10-16 16:17:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986134456] [2022-10-16 16:17:49,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986134456] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:49,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:49,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87960578] [2022-10-16 16:17:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:17:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:17:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:49,667 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:49,762 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2022-10-16 16:17:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:17:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-16 16:17:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:49,766 INFO L225 Difference]: With dead ends: 206 [2022-10-16 16:17:49,766 INFO L226 Difference]: Without dead ends: 141 [2022-10-16 16:17:49,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:49,771 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 74 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:49,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:17:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-16 16:17:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2022-10-16 16:17:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.564102564102564) internal successors, (183), 128 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-16 16:17:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2022-10-16 16:17:49,816 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 34 [2022-10-16 16:17:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:49,819 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2022-10-16 16:17:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2022-10-16 16:17:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 16:17:49,821 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:49,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:49,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 16:17:49,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash -576537676, now seen corresponding path program 1 times [2022-10-16 16:17:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:49,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106901219] [2022-10-16 16:17:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:50,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106901219] [2022-10-16 16:17:50,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106901219] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:50,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:50,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393417108] [2022-10-16 16:17:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:17:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:17:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:50,025 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-16 16:17:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:50,090 INFO L93 Difference]: Finished difference Result 333 states and 485 transitions. [2022-10-16 16:17:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:17:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 35 [2022-10-16 16:17:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:50,093 INFO L225 Difference]: With dead ends: 333 [2022-10-16 16:17:50,093 INFO L226 Difference]: Without dead ends: 223 [2022-10-16 16:17:50,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:50,096 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:50,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:17:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-16 16:17:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-10-16 16:17:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 199 states have (on average 1.6030150753768844) internal successors, (319), 210 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2022-10-16 16:17:50,130 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 35 [2022-10-16 16:17:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:50,130 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2022-10-16 16:17:50,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-16 16:17:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2022-10-16 16:17:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 16:17:50,132 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:50,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:50,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 16:17:50,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:50,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1557567312, now seen corresponding path program 1 times [2022-10-16 16:17:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:50,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31716404] [2022-10-16 16:17:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:50,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31716404] [2022-10-16 16:17:50,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31716404] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:50,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:50,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455693084] [2022-10-16 16:17:50,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:50,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:17:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:17:50,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:50,254 INFO L87 Difference]: Start difference. First operand 211 states and 319 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-16 16:17:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:50,487 INFO L93 Difference]: Finished difference Result 592 states and 919 transitions. [2022-10-16 16:17:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:17:50,488 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 36 [2022-10-16 16:17:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:50,493 INFO L225 Difference]: With dead ends: 592 [2022-10-16 16:17:50,494 INFO L226 Difference]: Without dead ends: 589 [2022-10-16 16:17:50,495 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-16 16:17:50,496 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:50,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 251 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-10-16 16:17:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 391. [2022-10-16 16:17:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 379 states have (on average 1.6015831134564644) internal successors, (607), 390 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2022-10-16 16:17:50,557 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 36 [2022-10-16 16:17:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:50,557 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2022-10-16 16:17:50,557 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-16 16:17:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2022-10-16 16:17:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 16:17:50,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:50,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:50,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 16:17:50,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1039946552, now seen corresponding path program 1 times [2022-10-16 16:17:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:50,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183892337] [2022-10-16 16:17:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:50,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183892337] [2022-10-16 16:17:50,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183892337] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:50,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:50,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732370806] [2022-10-16 16:17:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:17:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:17:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:50,670 INFO L87 Difference]: Start difference. First operand 391 states and 607 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-16 16:17:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:50,842 INFO L93 Difference]: Finished difference Result 580 states and 907 transitions. [2022-10-16 16:17:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:17:50,843 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 37 [2022-10-16 16:17:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:50,849 INFO L225 Difference]: With dead ends: 580 [2022-10-16 16:17:50,850 INFO L226 Difference]: Without dead ends: 577 [2022-10-16 16:17:50,850 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-16 16:17:50,859 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 245 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:50,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 142 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-10-16 16:17:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2022-10-16 16:17:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 559 states have (on average 1.5796064400715564) internal successors, (883), 570 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 883 transitions. [2022-10-16 16:17:50,956 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 883 transitions. Word has length 37 [2022-10-16 16:17:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:50,958 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 883 transitions. [2022-10-16 16:17:50,961 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-16 16:17:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 883 transitions. [2022-10-16 16:17:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 16:17:50,969 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:50,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 16:17:50,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2121395118, now seen corresponding path program 1 times [2022-10-16 16:17:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:50,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019412709] [2022-10-16 16:17:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:51,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019412709] [2022-10-16 16:17:51,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019412709] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:51,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:51,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:17:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461760303] [2022-10-16 16:17:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:51,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:17:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:51,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:17:51,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:17:51,153 INFO L87 Difference]: Start difference. First operand 571 states and 883 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 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-16 16:17:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:51,569 INFO L93 Difference]: Finished difference Result 2047 states and 3187 transitions. [2022-10-16 16:17:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 16:17:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 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 38 [2022-10-16 16:17:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:51,578 INFO L225 Difference]: With dead ends: 2047 [2022-10-16 16:17:51,578 INFO L226 Difference]: Without dead ends: 1495 [2022-10-16 16:17:51,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 16:17:51,583 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 519 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:51,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 575 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 16:17:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-10-16 16:17:51,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1111. [2022-10-16 16:17:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1099 states have (on average 1.535031847133758) internal successors, (1687), 1110 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1687 transitions. [2022-10-16 16:17:51,711 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1687 transitions. Word has length 38 [2022-10-16 16:17:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:51,713 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1687 transitions. [2022-10-16 16:17:51,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 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-16 16:17:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1687 transitions. [2022-10-16 16:17:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 16:17:51,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:51,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:51,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 16:17:51,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1338739078, now seen corresponding path program 1 times [2022-10-16 16:17:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649463783] [2022-10-16 16:17:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649463783] [2022-10-16 16:17:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649463783] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:51,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:51,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:17:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985582964] [2022-10-16 16:17:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:17:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:17:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:17:51,850 INFO L87 Difference]: Start difference. First operand 1111 states and 1687 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:52,161 INFO L93 Difference]: Finished difference Result 1486 states and 2275 transitions. [2022-10-16 16:17:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 16:17:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2022-10-16 16:17:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:52,171 INFO L225 Difference]: With dead ends: 1486 [2022-10-16 16:17:52,172 INFO L226 Difference]: Without dead ends: 1483 [2022-10-16 16:17:52,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 16:17:52,174 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 495 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:52,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 276 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 16:17:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-10-16 16:17:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2022-10-16 16:17:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1459 states have (on average 1.5099383139136395) internal successors, (2203), 1470 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2022-10-16 16:17:52,319 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 39 [2022-10-16 16:17:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:52,319 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2022-10-16 16:17:52,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2022-10-16 16:17:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 16:17:52,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:52,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 16:17:52,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1056432401, now seen corresponding path program 1 times [2022-10-16 16:17:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:52,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531014801] [2022-10-16 16:17:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531014801] [2022-10-16 16:17:52,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531014801] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:52,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:52,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719701447] [2022-10-16 16:17:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:52,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:17:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:17:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:52,373 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:52,629 INFO L93 Difference]: Finished difference Result 4023 states and 6027 transitions. [2022-10-16 16:17:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:17:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-10-16 16:17:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:52,644 INFO L225 Difference]: With dead ends: 4023 [2022-10-16 16:17:52,644 INFO L226 Difference]: Without dead ends: 2571 [2022-10-16 16:17:52,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:52,648 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 75 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:52,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:17:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-10-16 16:17:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2559. [2022-10-16 16:17:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2547 states have (on average 1.4962701217118177) internal successors, (3811), 2558 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3811 transitions. [2022-10-16 16:17:52,926 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3811 transitions. Word has length 40 [2022-10-16 16:17:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:52,927 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 3811 transitions. [2022-10-16 16:17:52,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3811 transitions. [2022-10-16 16:17:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 16:17:52,928 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:52,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:52,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 16:17:52,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1624205634, now seen corresponding path program 1 times [2022-10-16 16:17:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:52,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051458692] [2022-10-16 16:17:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:53,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051458692] [2022-10-16 16:17:53,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051458692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:53,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:53,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478535435] [2022-10-16 16:17:53,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:53,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:17:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:17:53,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:53,016 INFO L87 Difference]: Start difference. First operand 2559 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:53,406 INFO L93 Difference]: Finished difference Result 5815 states and 8629 transitions. [2022-10-16 16:17:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:17:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-10-16 16:17:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:53,426 INFO L225 Difference]: With dead ends: 5815 [2022-10-16 16:17:53,427 INFO L226 Difference]: Without dead ends: 3275 [2022-10-16 16:17:53,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:17:53,437 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:53,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:17:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-10-16 16:17:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3229. [2022-10-16 16:17:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4762200808206403) internal successors, (4749), 3228 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4749 transitions. [2022-10-16 16:17:53,804 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4749 transitions. Word has length 61 [2022-10-16 16:17:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:53,805 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4749 transitions. [2022-10-16 16:17:53,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4749 transitions. [2022-10-16 16:17:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 16:17:53,808 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:53,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 16:17:53,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2031721315, now seen corresponding path program 1 times [2022-10-16 16:17:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125462152] [2022-10-16 16:17:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:17:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125462152] [2022-10-16 16:17:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125462152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:54,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:54,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 16:17:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905906730] [2022-10-16 16:17:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:54,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:17:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:17:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:17:54,134 INFO L87 Difference]: Start difference. First operand 3229 states and 4749 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-16 16:17:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:54,554 INFO L93 Difference]: Finished difference Result 6443 states and 9477 transitions. [2022-10-16 16:17:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:17:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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) Word has length 65 [2022-10-16 16:17:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:54,572 INFO L225 Difference]: With dead ends: 6443 [2022-10-16 16:17:54,572 INFO L226 Difference]: Without dead ends: 3235 [2022-10-16 16:17:54,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-16 16:17:54,578 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 121 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:54,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 275 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-10-16 16:17:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3229. [2022-10-16 16:17:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4662729250854833) internal successors, (4717), 3228 states have internal predecessors, (4717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4717 transitions. [2022-10-16 16:17:54,936 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4717 transitions. Word has length 65 [2022-10-16 16:17:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:54,937 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4717 transitions. [2022-10-16 16:17:54,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-16 16:17:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4717 transitions. [2022-10-16 16:17:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 16:17:54,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:54,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 16:17:54,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 947482817, now seen corresponding path program 1 times [2022-10-16 16:17:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326965040] [2022-10-16 16:17:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:17:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:55,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326965040] [2022-10-16 16:17:55,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326965040] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:55,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:55,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053199616] [2022-10-16 16:17:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:55,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:17:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:17:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:55,082 INFO L87 Difference]: Start difference. First operand 3229 states and 4717 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:55,511 INFO L93 Difference]: Finished difference Result 4189 states and 6133 transitions. [2022-10-16 16:17:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:17:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 66 [2022-10-16 16:17:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:55,534 INFO L225 Difference]: With dead ends: 4189 [2022-10-16 16:17:55,534 INFO L226 Difference]: Without dead ends: 4186 [2022-10-16 16:17:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:55,538 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 124 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:55,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 277 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2022-10-16 16:17:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3277. [2022-10-16 16:17:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3265 states have (on average 1.475344563552833) internal successors, (4817), 3276 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4817 transitions. [2022-10-16 16:17:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4817 transitions. Word has length 66 [2022-10-16 16:17:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:55,926 INFO L495 AbstractCegarLoop]: Abstraction has 3277 states and 4817 transitions. [2022-10-16 16:17:55,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4817 transitions. [2022-10-16 16:17:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 16:17:55,928 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:55,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:55,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 16:17:55,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1013767766, now seen corresponding path program 1 times [2022-10-16 16:17:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065617057] [2022-10-16 16:17:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:17:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065617057] [2022-10-16 16:17:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065617057] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:56,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:56,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814790358] [2022-10-16 16:17:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:17:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:17:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:56,029 INFO L87 Difference]: Start difference. First operand 3277 states and 4817 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:56,539 INFO L93 Difference]: Finished difference Result 5140 states and 7525 transitions. [2022-10-16 16:17:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:17:56,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 68 [2022-10-16 16:17:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:56,568 INFO L225 Difference]: With dead ends: 5140 [2022-10-16 16:17:56,568 INFO L226 Difference]: Without dead ends: 5137 [2022-10-16 16:17:56,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:56,571 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:56,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 272 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-10-16 16:17:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5125. [2022-10-16 16:17:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5113 states have (on average 1.4576569528652454) internal successors, (7453), 5124 states have internal predecessors, (7453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7453 transitions. [2022-10-16 16:17:57,078 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7453 transitions. Word has length 68 [2022-10-16 16:17:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:57,078 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7453 transitions. [2022-10-16 16:17:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7453 transitions. [2022-10-16 16:17:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 16:17:57,080 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:57,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:57,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 16:17:57,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -459438275, now seen corresponding path program 1 times [2022-10-16 16:17:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129750917] [2022-10-16 16:17:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 16:17:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:57,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129750917] [2022-10-16 16:17:57,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129750917] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:57,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:57,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:17:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848533789] [2022-10-16 16:17:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:57,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:17:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:17:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:17:57,229 INFO L87 Difference]: Start difference. First operand 5125 states and 7453 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:57,876 INFO L93 Difference]: Finished difference Result 10687 states and 15465 transitions. [2022-10-16 16:17:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 16:17:57,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 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 68 [2022-10-16 16:17:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:57,902 INFO L225 Difference]: With dead ends: 10687 [2022-10-16 16:17:57,902 INFO L226 Difference]: Without dead ends: 5583 [2022-10-16 16:17:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:17:57,911 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 272 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:57,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 361 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2022-10-16 16:17:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5125. [2022-10-16 16:17:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5113 states have (on average 1.4490514375122237) internal successors, (7409), 5124 states have internal predecessors, (7409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7409 transitions. [2022-10-16 16:17:58,480 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7409 transitions. Word has length 68 [2022-10-16 16:17:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7409 transitions. [2022-10-16 16:17:58,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7409 transitions. [2022-10-16 16:17:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 16:17:58,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:58,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:58,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 16:17:58,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2075261, now seen corresponding path program 1 times [2022-10-16 16:17:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:58,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822998624] [2022-10-16 16:17:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:17:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822998624] [2022-10-16 16:17:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822998624] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:58,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:58,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:17:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147691624] [2022-10-16 16:17:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:58,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:17:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:17:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:17:58,626 INFO L87 Difference]: Start difference. First operand 5125 states and 7409 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:17:59,228 INFO L93 Difference]: Finished difference Result 10058 states and 14493 transitions. [2022-10-16 16:17:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:17:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 68 [2022-10-16 16:17:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:17:59,245 INFO L225 Difference]: With dead ends: 10058 [2022-10-16 16:17:59,245 INFO L226 Difference]: Without dead ends: 6802 [2022-10-16 16:17:59,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:17:59,252 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 277 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:17:59,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 383 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:17:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2022-10-16 16:17:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6793. [2022-10-16 16:17:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6793 states, 6781 states have (on average 1.4188172835864916) internal successors, (9621), 6792 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9621 transitions. [2022-10-16 16:17:59,789 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9621 transitions. Word has length 68 [2022-10-16 16:17:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:17:59,789 INFO L495 AbstractCegarLoop]: Abstraction has 6793 states and 9621 transitions. [2022-10-16 16:17:59,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:17:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9621 transitions. [2022-10-16 16:17:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 16:17:59,791 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:17:59,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:17:59,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 16:17:59,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:17:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:17:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029810, now seen corresponding path program 1 times [2022-10-16 16:17:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:17:59,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139995417] [2022-10-16 16:17:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:17:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:17:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:17:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:17:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:17:59,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139995417] [2022-10-16 16:17:59,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139995417] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:17:59,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:17:59,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:17:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447881089] [2022-10-16 16:17:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:17:59,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:17:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:17:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:17:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:17:59,888 INFO L87 Difference]: Start difference. First operand 6793 states and 9621 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:00,457 INFO L93 Difference]: Finished difference Result 6799 states and 9621 transitions. [2022-10-16 16:18:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:18:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 69 [2022-10-16 16:18:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:00,475 INFO L225 Difference]: With dead ends: 6799 [2022-10-16 16:18:00,475 INFO L226 Difference]: Without dead ends: 6796 [2022-10-16 16:18:00,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:18:00,478 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:00,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 214 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2022-10-16 16:18:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 6790. [2022-10-16 16:18:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6790 states, 6781 states have (on average 1.3975814776581625) internal successors, (9477), 6789 states have internal predecessors, (9477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 9477 transitions. [2022-10-16 16:18:01,128 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 9477 transitions. Word has length 69 [2022-10-16 16:18:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:01,128 INFO L495 AbstractCegarLoop]: Abstraction has 6790 states and 9477 transitions. [2022-10-16 16:18:01,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 9477 transitions. [2022-10-16 16:18:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 16:18:01,130 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:01,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 16:18:01,131 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -64332951, now seen corresponding path program 1 times [2022-10-16 16:18:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:01,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623423691] [2022-10-16 16:18:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623423691] [2022-10-16 16:18:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623423691] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505102817] [2022-10-16 16:18:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:01,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:01,246 INFO L87 Difference]: Start difference. First operand 6790 states and 9477 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-16 16:18:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:01,929 INFO L93 Difference]: Finished difference Result 13530 states and 19329 transitions. [2022-10-16 16:18:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:01,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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 69 [2022-10-16 16:18:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:01,950 INFO L225 Difference]: With dead ends: 13530 [2022-10-16 16:18:01,951 INFO L226 Difference]: Without dead ends: 9061 [2022-10-16 16:18:01,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:18:01,959 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 289 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:01,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9061 states. [2022-10-16 16:18:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9061 to 7966. [2022-10-16 16:18:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7966 states, 7957 states have (on average 1.4212642955887898) internal successors, (11309), 7965 states have internal predecessors, (11309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 11309 transitions. [2022-10-16 16:18:02,597 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 11309 transitions. Word has length 69 [2022-10-16 16:18:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:02,597 INFO L495 AbstractCegarLoop]: Abstraction has 7966 states and 11309 transitions. [2022-10-16 16:18:02,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 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-16 16:18:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 11309 transitions. [2022-10-16 16:18:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 16:18:02,599 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:02,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:02,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 16:18:02,599 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash -726748712, now seen corresponding path program 1 times [2022-10-16 16:18:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:02,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606853243] [2022-10-16 16:18:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:02,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606853243] [2022-10-16 16:18:02,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606853243] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:02,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:02,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187848225] [2022-10-16 16:18:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:02,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:02,737 INFO L87 Difference]: Start difference. First operand 7966 states and 11309 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-16 16:18:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:03,522 INFO L93 Difference]: Finished difference Result 14620 states and 20973 transitions. [2022-10-16 16:18:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:03,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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) Word has length 70 [2022-10-16 16:18:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:03,542 INFO L225 Difference]: With dead ends: 14620 [2022-10-16 16:18:03,542 INFO L226 Difference]: Without dead ends: 8923 [2022-10-16 16:18:03,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:18:03,553 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 265 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:03,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 389 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2022-10-16 16:18:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 8914. [2022-10-16 16:18:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8914 states, 8905 states have (on average 1.413700168444694) internal successors, (12589), 8913 states have internal predecessors, (12589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12589 transitions. [2022-10-16 16:18:04,292 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12589 transitions. Word has length 70 [2022-10-16 16:18:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:04,292 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12589 transitions. [2022-10-16 16:18:04,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-16 16:18:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12589 transitions. [2022-10-16 16:18:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 16:18:04,294 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:04,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 16:18:04,295 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1134710146, now seen corresponding path program 1 times [2022-10-16 16:18:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240110097] [2022-10-16 16:18:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240110097] [2022-10-16 16:18:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240110097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:04,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:04,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:18:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092731734] [2022-10-16 16:18:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:18:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:18:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:18:04,390 INFO L87 Difference]: Start difference. First operand 8914 states and 12589 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 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-16 16:18:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:05,304 INFO L93 Difference]: Finished difference Result 10822 states and 15421 transitions. [2022-10-16 16:18:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:18:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 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) Word has length 70 [2022-10-16 16:18:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:05,326 INFO L225 Difference]: With dead ends: 10822 [2022-10-16 16:18:05,327 INFO L226 Difference]: Without dead ends: 10819 [2022-10-16 16:18:05,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:18:05,332 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 155 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:05,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 416 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-10-16 16:18:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 8914. [2022-10-16 16:18:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8914 states, 8905 states have (on average 1.3975294778214487) internal successors, (12445), 8913 states have internal predecessors, (12445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12445 transitions. [2022-10-16 16:18:06,201 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12445 transitions. Word has length 70 [2022-10-16 16:18:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:06,201 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12445 transitions. [2022-10-16 16:18:06,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 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-16 16:18:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12445 transitions. [2022-10-16 16:18:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 16:18:06,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:06,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:06,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 16:18:06,204 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -296117079, now seen corresponding path program 1 times [2022-10-16 16:18:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:06,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715629068] [2022-10-16 16:18:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:06,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715629068] [2022-10-16 16:18:06,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715629068] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:06,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:06,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697346251] [2022-10-16 16:18:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:06,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:06,331 INFO L87 Difference]: Start difference. First operand 8914 states and 12445 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 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-16 16:18:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:07,336 INFO L93 Difference]: Finished difference Result 9368 states and 13073 transitions. [2022-10-16 16:18:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:07,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 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) Word has length 70 [2022-10-16 16:18:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:07,355 INFO L225 Difference]: With dead ends: 9368 [2022-10-16 16:18:07,355 INFO L226 Difference]: Without dead ends: 9365 [2022-10-16 16:18:07,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:07,360 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 188 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:07,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 424 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2022-10-16 16:18:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9362. [2022-10-16 16:18:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9362 states, 9353 states have (on average 1.394311985459211) internal successors, (13041), 9361 states have internal predecessors, (13041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 13041 transitions. [2022-10-16 16:18:08,322 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 13041 transitions. Word has length 70 [2022-10-16 16:18:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:08,322 INFO L495 AbstractCegarLoop]: Abstraction has 9362 states and 13041 transitions. [2022-10-16 16:18:08,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 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-16 16:18:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 13041 transitions. [2022-10-16 16:18:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 16:18:08,324 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:08,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:08,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 16:18:08,324 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1054373452, now seen corresponding path program 1 times [2022-10-16 16:18:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:08,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383223472] [2022-10-16 16:18:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:08,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:08,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383223472] [2022-10-16 16:18:08,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383223472] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:08,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:08,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774567657] [2022-10-16 16:18:08,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:08,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:08,453 INFO L87 Difference]: Start difference. First operand 9362 states and 13041 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:09,473 INFO L93 Difference]: Finished difference Result 18998 states and 26973 transitions. [2022-10-16 16:18:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 71 [2022-10-16 16:18:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:09,499 INFO L225 Difference]: With dead ends: 18998 [2022-10-16 16:18:09,499 INFO L226 Difference]: Without dead ends: 12353 [2022-10-16 16:18:09,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:18:09,515 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 297 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:09,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 270 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2022-10-16 16:18:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 10442. [2022-10-16 16:18:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10442 states, 10433 states have (on average 1.400651778012077) internal successors, (14613), 10441 states have internal predecessors, (14613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 14613 transitions. [2022-10-16 16:18:10,369 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 14613 transitions. Word has length 71 [2022-10-16 16:18:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:10,369 INFO L495 AbstractCegarLoop]: Abstraction has 10442 states and 14613 transitions. [2022-10-16 16:18:10,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 14613 transitions. [2022-10-16 16:18:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 16:18:10,372 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:10,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:10,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 16:18:10,372 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash -922601538, now seen corresponding path program 1 times [2022-10-16 16:18:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626733826] [2022-10-16 16:18:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:10,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626733826] [2022-10-16 16:18:10,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626733826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:10,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:10,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201505635] [2022-10-16 16:18:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:10,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:10,535 INFO L87 Difference]: Start difference. First operand 10442 states and 14613 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:11,536 INFO L93 Difference]: Finished difference Result 11396 states and 15957 transitions. [2022-10-16 16:18:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 72 [2022-10-16 16:18:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:11,550 INFO L225 Difference]: With dead ends: 11396 [2022-10-16 16:18:11,551 INFO L226 Difference]: Without dead ends: 11393 [2022-10-16 16:18:11,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:11,555 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 187 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:11,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11393 states. [2022-10-16 16:18:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11393 to 11390. [2022-10-16 16:18:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11390 states, 11381 states have (on average 1.3978560759160004) internal successors, (15909), 11389 states have internal predecessors, (15909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11390 states to 11390 states and 15909 transitions. [2022-10-16 16:18:12,593 INFO L78 Accepts]: Start accepts. Automaton has 11390 states and 15909 transitions. Word has length 72 [2022-10-16 16:18:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:12,594 INFO L495 AbstractCegarLoop]: Abstraction has 11390 states and 15909 transitions. [2022-10-16 16:18:12,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11390 states and 15909 transitions. [2022-10-16 16:18:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 16:18:12,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:12,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 16:18:12,597 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -465238524, now seen corresponding path program 1 times [2022-10-16 16:18:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:12,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127634593] [2022-10-16 16:18:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:12,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:12,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127634593] [2022-10-16 16:18:12,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127634593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:12,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:12,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112753453] [2022-10-16 16:18:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:12,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:12,741 INFO L87 Difference]: Start difference. First operand 11390 states and 15909 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:14,373 INFO L93 Difference]: Finished difference Result 14249 states and 20013 transitions. [2022-10-16 16:18:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 72 [2022-10-16 16:18:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:14,407 INFO L225 Difference]: With dead ends: 14249 [2022-10-16 16:18:14,407 INFO L226 Difference]: Without dead ends: 14246 [2022-10-16 16:18:14,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:14,415 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 187 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:14,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 476 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14246 states. [2022-10-16 16:18:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14246 to 14234. [2022-10-16 16:18:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14234 states, 14225 states have (on average 1.4001405975395431) internal successors, (19917), 14233 states have internal predecessors, (19917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 19917 transitions. [2022-10-16 16:18:15,648 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 19917 transitions. Word has length 72 [2022-10-16 16:18:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:15,649 INFO L495 AbstractCegarLoop]: Abstraction has 14234 states and 19917 transitions. [2022-10-16 16:18:15,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 19917 transitions. [2022-10-16 16:18:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-16 16:18:15,651 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:15,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:15,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 16:18:15,652 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492216, now seen corresponding path program 1 times [2022-10-16 16:18:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:15,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165229041] [2022-10-16 16:18:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165229041] [2022-10-16 16:18:15,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165229041] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:15,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:15,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293468642] [2022-10-16 16:18:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:15,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:15,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:15,815 INFO L87 Difference]: Start difference. First operand 14234 states and 19917 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:16,764 INFO L93 Difference]: Finished difference Result 16508 states and 23117 transitions. [2022-10-16 16:18:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:16,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2022-10-16 16:18:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:16,776 INFO L225 Difference]: With dead ends: 16508 [2022-10-16 16:18:16,776 INFO L226 Difference]: Without dead ends: 10182 [2022-10-16 16:18:16,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:16,783 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:16,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 326 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2022-10-16 16:18:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 7722. [2022-10-16 16:18:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7713 states have (on average 1.3988072086088421) internal successors, (10789), 7721 states have internal predecessors, (10789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 10789 transitions. [2022-10-16 16:18:17,432 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 10789 transitions. Word has length 73 [2022-10-16 16:18:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:17,432 INFO L495 AbstractCegarLoop]: Abstraction has 7722 states and 10789 transitions. [2022-10-16 16:18:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 10789 transitions. [2022-10-16 16:18:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 16:18:17,434 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:17,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:17,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 16:18:17,435 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1280585962, now seen corresponding path program 1 times [2022-10-16 16:18:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:17,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369173099] [2022-10-16 16:18:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:17,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369173099] [2022-10-16 16:18:17,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369173099] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:17,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:17,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524549975] [2022-10-16 16:18:17,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:17,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:17,563 INFO L87 Difference]: Start difference. First operand 7722 states and 10789 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:18,447 INFO L93 Difference]: Finished difference Result 7947 states and 11093 transitions. [2022-10-16 16:18:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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 74 [2022-10-16 16:18:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:18,457 INFO L225 Difference]: With dead ends: 7947 [2022-10-16 16:18:18,458 INFO L226 Difference]: Without dead ends: 7506 [2022-10-16 16:18:18,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:18,461 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 187 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:18,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 644 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2022-10-16 16:18:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 7502. [2022-10-16 16:18:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7502 states, 7493 states have (on average 1.3977045242226078) internal successors, (10473), 7501 states have internal predecessors, (10473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10473 transitions. [2022-10-16 16:18:19,131 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10473 transitions. Word has length 74 [2022-10-16 16:18:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:19,131 INFO L495 AbstractCegarLoop]: Abstraction has 7502 states and 10473 transitions. [2022-10-16 16:18:19,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10473 transitions. [2022-10-16 16:18:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 16:18:19,136 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:19,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:19,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 16:18:19,137 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1014831339, now seen corresponding path program 1 times [2022-10-16 16:18:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:19,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437089683] [2022-10-16 16:18:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:19,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437089683] [2022-10-16 16:18:19,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437089683] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:19,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:18:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050055143] [2022-10-16 16:18:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:18:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:18:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:18:19,263 INFO L87 Difference]: Start difference. First operand 7502 states and 10473 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:19,984 INFO L93 Difference]: Finished difference Result 7728 states and 10773 transitions. [2022-10-16 16:18:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:18:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-16 16:18:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:19,995 INFO L225 Difference]: With dead ends: 7728 [2022-10-16 16:18:19,995 INFO L226 Difference]: Without dead ends: 7725 [2022-10-16 16:18:19,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 16:18:19,999 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 129 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 344 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2022-10-16 16:18:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7499. [2022-10-16 16:18:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7499 states, 7493 states have (on average 1.365674629654344) internal successors, (10233), 7498 states have internal predecessors, (10233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 10233 transitions. [2022-10-16 16:18:20,554 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 10233 transitions. Word has length 95 [2022-10-16 16:18:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:20,554 INFO L495 AbstractCegarLoop]: Abstraction has 7499 states and 10233 transitions. [2022-10-16 16:18:20,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 10233 transitions. [2022-10-16 16:18:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 16:18:20,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:20,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:20,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 16:18:20,560 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1641497059, now seen corresponding path program 1 times [2022-10-16 16:18:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:20,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513947923] [2022-10-16 16:18:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 16:18:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:20,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513947923] [2022-10-16 16:18:20,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513947923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:20,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:20,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724629166] [2022-10-16 16:18:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:20,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:20,755 INFO L87 Difference]: Start difference. First operand 7499 states and 10233 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:21,494 INFO L93 Difference]: Finished difference Result 8045 states and 10981 transitions. [2022-10-16 16:18:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 97 [2022-10-16 16:18:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:21,503 INFO L225 Difference]: With dead ends: 8045 [2022-10-16 16:18:21,504 INFO L226 Difference]: Without dead ends: 7192 [2022-10-16 16:18:21,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:21,508 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 184 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:21,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 631 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2022-10-16 16:18:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 7183. [2022-10-16 16:18:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7183 states, 7177 states have (on average 1.3683990525289118) internal successors, (9821), 7182 states have internal predecessors, (9821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 9821 transitions. [2022-10-16 16:18:22,102 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 9821 transitions. Word has length 97 [2022-10-16 16:18:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:22,103 INFO L495 AbstractCegarLoop]: Abstraction has 7183 states and 9821 transitions. [2022-10-16 16:18:22,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 9821 transitions. [2022-10-16 16:18:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 16:18:22,107 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:22,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:22,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 16:18:22,107 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1064049893, now seen corresponding path program 1 times [2022-10-16 16:18:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:22,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106272335] [2022-10-16 16:18:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:22,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-16 16:18:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:22,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106272335] [2022-10-16 16:18:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106272335] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:22,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:22,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 16:18:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022113472] [2022-10-16 16:18:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:22,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:18:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:18:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:18:22,172 INFO L87 Difference]: Start difference. First operand 7183 states and 9821 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:23,055 INFO L93 Difference]: Finished difference Result 16155 states and 22155 transitions. [2022-10-16 16:18:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:18:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 97 [2022-10-16 16:18:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:23,068 INFO L225 Difference]: With dead ends: 16155 [2022-10-16 16:18:23,069 INFO L226 Difference]: Without dead ends: 9925 [2022-10-16 16:18:23,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:18:23,077 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 63 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 238 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.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:23,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:18:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9925 states. [2022-10-16 16:18:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9925 to 9579. [2022-10-16 16:18:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 9573 states have (on average 1.3447195236602947) internal successors, (12873), 9578 states have internal predecessors, (12873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 12873 transitions. [2022-10-16 16:18:23,847 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 12873 transitions. Word has length 97 [2022-10-16 16:18:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:23,847 INFO L495 AbstractCegarLoop]: Abstraction has 9579 states and 12873 transitions. [2022-10-16 16:18:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 12873 transitions. [2022-10-16 16:18:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 16:18:23,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:23,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 16:18:23,852 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash 295344941, now seen corresponding path program 2 times [2022-10-16 16:18:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154635521] [2022-10-16 16:18:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154635521] [2022-10-16 16:18:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154635521] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:23,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:23,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518960883] [2022-10-16 16:18:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:23,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:23,999 INFO L87 Difference]: Start difference. First operand 9579 states and 12873 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:25,152 INFO L93 Difference]: Finished difference Result 13674 states and 18519 transitions. [2022-10-16 16:18:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 97 [2022-10-16 16:18:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:25,162 INFO L225 Difference]: With dead ends: 13674 [2022-10-16 16:18:25,162 INFO L226 Difference]: Without dead ends: 7564 [2022-10-16 16:18:25,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:25,170 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 195 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:25,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 487 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2022-10-16 16:18:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7555. [2022-10-16 16:18:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3420320572261226) internal successors, (10131), 7554 states have internal predecessors, (10131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10131 transitions. [2022-10-16 16:18:25,772 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10131 transitions. Word has length 97 [2022-10-16 16:18:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:25,772 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10131 transitions. [2022-10-16 16:18:25,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10131 transitions. [2022-10-16 16:18:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-16 16:18:25,776 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:25,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-10-16 16:18:25,776 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -58450279, now seen corresponding path program 1 times [2022-10-16 16:18:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303596469] [2022-10-16 16:18:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 16:18:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:25,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303596469] [2022-10-16 16:18:25,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303596469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:25,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:25,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839560906] [2022-10-16 16:18:25,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:25,927 INFO L87 Difference]: Start difference. First operand 7555 states and 10131 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:26,736 INFO L93 Difference]: Finished difference Result 7558 states and 10131 transitions. [2022-10-16 16:18:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 99 [2022-10-16 16:18:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:26,746 INFO L225 Difference]: With dead ends: 7558 [2022-10-16 16:18:26,746 INFO L226 Difference]: Without dead ends: 7555 [2022-10-16 16:18:26,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:26,750 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 159 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:26,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 445 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-10-16 16:18:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-10-16 16:18:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3372632136706848) internal successors, (10095), 7554 states have internal predecessors, (10095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10095 transitions. [2022-10-16 16:18:27,344 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10095 transitions. Word has length 99 [2022-10-16 16:18:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:27,345 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10095 transitions. [2022-10-16 16:18:27,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10095 transitions. [2022-10-16 16:18:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 16:18:27,348 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:27,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-16 16:18:27,349 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -308445212, now seen corresponding path program 1 times [2022-10-16 16:18:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:27,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363335501] [2022-10-16 16:18:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 16:18:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363335501] [2022-10-16 16:18:27,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363335501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:27,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:27,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475945748] [2022-10-16 16:18:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:27,495 INFO L87 Difference]: Start difference. First operand 7555 states and 10095 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:28,204 INFO L93 Difference]: Finished difference Result 7558 states and 10095 transitions. [2022-10-16 16:18:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-16 16:18:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:28,212 INFO L225 Difference]: With dead ends: 7558 [2022-10-16 16:18:28,212 INFO L226 Difference]: Without dead ends: 7555 [2022-10-16 16:18:28,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:28,214 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 153 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:28,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 451 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-10-16 16:18:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-10-16 16:18:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3335541131275666) internal successors, (10067), 7554 states have internal predecessors, (10067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10067 transitions. [2022-10-16 16:18:28,804 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10067 transitions. Word has length 101 [2022-10-16 16:18:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:28,804 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10067 transitions. [2022-10-16 16:18:28,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10067 transitions. [2022-10-16 16:18:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 16:18:28,807 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:28,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:28,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-10-16 16:18:28,808 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1302363118, now seen corresponding path program 1 times [2022-10-16 16:18:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:28,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059734018] [2022-10-16 16:18:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:28,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059734018] [2022-10-16 16:18:28,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059734018] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:28,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:28,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072063408] [2022-10-16 16:18:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:28,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:28,970 INFO L87 Difference]: Start difference. First operand 7555 states and 10067 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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-16 16:18:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:29,628 INFO L93 Difference]: Finished difference Result 7561 states and 10067 transitions. [2022-10-16 16:18:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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) Word has length 101 [2022-10-16 16:18:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:29,637 INFO L225 Difference]: With dead ends: 7561 [2022-10-16 16:18:29,637 INFO L226 Difference]: Without dead ends: 7558 [2022-10-16 16:18:29,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:29,640 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 161 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:29,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 402 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2022-10-16 16:18:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7555. [2022-10-16 16:18:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.32613591204133) internal successors, (10011), 7554 states have internal predecessors, (10011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10011 transitions. [2022-10-16 16:18:30,278 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10011 transitions. Word has length 101 [2022-10-16 16:18:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:30,279 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10011 transitions. [2022-10-16 16:18:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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-16 16:18:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10011 transitions. [2022-10-16 16:18:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-16 16:18:30,282 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:30,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:30,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-10-16 16:18:30,282 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1718550854, now seen corresponding path program 1 times [2022-10-16 16:18:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:30,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761914314] [2022-10-16 16:18:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:30,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761914314] [2022-10-16 16:18:30,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761914314] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:30,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:30,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817734612] [2022-10-16 16:18:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:30,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:30,428 INFO L87 Difference]: Start difference. First operand 7555 states and 10011 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:31,174 INFO L93 Difference]: Finished difference Result 8837 states and 11785 transitions. [2022-10-16 16:18:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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-16 16:18:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:31,181 INFO L225 Difference]: With dead ends: 8837 [2022-10-16 16:18:31,182 INFO L226 Difference]: Without dead ends: 4627 [2022-10-16 16:18:31,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:31,188 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 137 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:31,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 378 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-10-16 16:18:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4226. [2022-10-16 16:18:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4225 states have (on average 1.3015384615384615) internal successors, (5499), 4225 states have internal predecessors, (5499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5499 transitions. [2022-10-16 16:18:31,579 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5499 transitions. Word has length 102 [2022-10-16 16:18:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:31,580 INFO L495 AbstractCegarLoop]: Abstraction has 4226 states and 5499 transitions. [2022-10-16 16:18:31,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5499 transitions. [2022-10-16 16:18:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-16 16:18:31,583 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:31,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:31,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-10-16 16:18:31,583 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1722623032, now seen corresponding path program 1 times [2022-10-16 16:18:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:31,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281327051] [2022-10-16 16:18:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 16:18:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281327051] [2022-10-16 16:18:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281327051] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:31,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:31,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468635255] [2022-10-16 16:18:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:31,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:31,765 INFO L87 Difference]: Start difference. First operand 4226 states and 5499 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:32,401 INFO L93 Difference]: Finished difference Result 4448 states and 5795 transitions. [2022-10-16 16:18:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:32,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 103 [2022-10-16 16:18:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:32,408 INFO L225 Difference]: With dead ends: 4448 [2022-10-16 16:18:32,409 INFO L226 Difference]: Without dead ends: 3787 [2022-10-16 16:18:32,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:32,412 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 172 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:32,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 531 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-10-16 16:18:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3566. [2022-10-16 16:18:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 1.293969144460028) internal successors, (4613), 3565 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4613 transitions. [2022-10-16 16:18:32,749 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4613 transitions. Word has length 103 [2022-10-16 16:18:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:32,750 INFO L495 AbstractCegarLoop]: Abstraction has 3566 states and 4613 transitions. [2022-10-16 16:18:32,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4613 transitions. [2022-10-16 16:18:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-16 16:18:32,753 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:32,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-10-16 16:18:32,754 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -37264520, now seen corresponding path program 2 times [2022-10-16 16:18:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:32,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813764866] [2022-10-16 16:18:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 16:18:32,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:32,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813764866] [2022-10-16 16:18:32,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813764866] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:32,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:32,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:32,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713715993] [2022-10-16 16:18:32,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:32,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:32,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:32,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:32,898 INFO L87 Difference]: Start difference. First operand 3566 states and 4613 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:33,406 INFO L93 Difference]: Finished difference Result 3567 states and 4613 transitions. [2022-10-16 16:18:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:33,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 103 [2022-10-16 16:18:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:33,410 INFO L225 Difference]: With dead ends: 3567 [2022-10-16 16:18:33,410 INFO L226 Difference]: Without dead ends: 2554 [2022-10-16 16:18:33,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:33,412 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:33,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 480 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-10-16 16:18:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2022-10-16 16:18:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.2867215041128084) internal successors, (3285), 2553 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3285 transitions. [2022-10-16 16:18:33,651 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3285 transitions. Word has length 103 [2022-10-16 16:18:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:33,651 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3285 transitions. [2022-10-16 16:18:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3285 transitions. [2022-10-16 16:18:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-16 16:18:33,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:18:33,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:18:33,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-10-16 16:18:33,655 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 16:18:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:18:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -131639445, now seen corresponding path program 1 times [2022-10-16 16:18:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:18:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581161446] [2022-10-16 16:18:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:18:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:18:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:18:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 16:18:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:18:33,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581161446] [2022-10-16 16:18:33,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581161446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:18:33,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:18:33,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 16:18:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838235804] [2022-10-16 16:18:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:18:33,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:18:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:18:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:18:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:33,811 INFO L87 Difference]: Start difference. First operand 2554 states and 3285 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:18:34,153 INFO L93 Difference]: Finished difference Result 2554 states and 3285 transitions. [2022-10-16 16:18:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 16:18:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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 125 [2022-10-16 16:18:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:18:34,154 INFO L225 Difference]: With dead ends: 2554 [2022-10-16 16:18:34,154 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 16:18:34,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:18:34,157 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 147 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:18:34,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 517 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 16:18:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 16:18:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 16:18:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 16:18:34,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2022-10-16 16:18:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:18:34,160 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 16:18:34,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:18:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 16:18:34,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 16:18:34,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-10-16 16:18:34,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-10-16 16:18:34,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-10-16 16:18:34,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-10-16 16:18:34,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-10-16 16:18:34,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-10-16 16:18:34,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-10-16 16:18:34,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-10-16 16:18:34,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-10-16 16:18:34,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-10-16 16:18:34,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-10-16 16:18:34,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-10-16 16:18:34,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-10-16 16:18:34,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-10-16 16:18:34,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-10-16 16:18:34,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 16:18:55,641 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 873 DAG size of output: 864 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-16 16:19:12,232 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 881 DAG size of output: 872 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-16 16:19:21,886 WARN L233 SmtUtils]: Spent 9.65s on a formula simplification. DAG size of input: 861 DAG size of output: 852 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-16 16:19:30,751 WARN L233 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 909 DAG size of output: 900 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-16 16:19:52,182 WARN L233 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 862 DAG size of output: 853 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-10-16 16:20:07,299 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 864 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 16:20:20,183 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 872 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 16:20:26,079 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 852 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 16:20:32,779 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 900 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 16:20:48,704 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 853 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-10-16 16:20:48,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,708 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-10-16 16:20:48,708 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 351) no Hoare annotation was computed. [2022-10-16 16:20:48,708 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-10-16 16:20:48,709 INFO L895 garLoopResultBuilder]: At program point L350(lines 135 351) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 16:20:48,710 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse10 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (let ((.cse4 (and .cse0 .cse10 .cse1)) (.cse3 (<= ~st2~0 0)) (.cse2 (<= 0 ~st2~0)) (.cse5 (<= ~st1~0 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (or (and .cse10 .cse1) (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse1 (<= .cse11 0) (<= 0 .cse11))))) (.cse9 (= ~st3~0 1))) (or (and (<= ~st3~0 0) (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (<= 0 ~st3~0)) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and .cse5 (<= 0 .cse6) .cse7 .cse8 (<= .cse6 0))) (and (or .cse4 (and .cse0 .cse1 .cse3)) .cse2 .cse9) (and .cse5 .cse7 .cse8 .cse9)))) [2022-10-16 16:20:48,710 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2022-10-16 16:20:48,710 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-10-16 16:20:48,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,711 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,711 INFO L902 garLoopResultBuilder]: At program point L467(lines 58 470) the Hoare annotation is: true [2022-10-16 16:20:48,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,711 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 346) no Hoare annotation was computed. [2022-10-16 16:20:48,712 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-10-16 16:20:48,712 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-10-16 16:20:48,712 INFO L895 garLoopResultBuilder]: At program point L369(lines 126 382) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,712 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 345) no Hoare annotation was computed. [2022-10-16 16:20:48,713 INFO L895 garLoopResultBuilder]: At program point L304(lines 150 305) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,713 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-10-16 16:20:48,713 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-10-16 16:20:48,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,713 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 384) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,714 INFO L895 garLoopResultBuilder]: At program point L355(lines 128 356) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse4 (<= ~st1~0 0)) (.cse7 (= ~st3~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 .cse10)) (.cse9 (<= 0 ~st2~0)) (.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse11 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 .cse6)) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse4 .cse7 (or (and .cse0 .cse1) (and .cse1 (<= .cse10 0) .cse6))) (and .cse8 .cse11 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse11 .cse2)))) [2022-10-16 16:20:48,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 16:20:48,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,714 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,715 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,715 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-10-16 16:20:48,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,715 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-10-16 16:20:48,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,715 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse8 (<= 0 ~st2~0)) (.cse4 (= ~st2~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0))) (let ((.cse0 (let ((.cse9 (= ~st1~0 1))) (or (and .cse9 .cse5 .cse8 (<= ~st2~0 0)) (and .cse9 .cse4 .cse5)))) (.cse2 (= ~st3~0 1)) (.cse3 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st3~0))) (or (and (<= ~st3~0 0) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2 (let ((.cse6 (<= ~st1~0 0))) (or (and .cse4 .cse5 .cse6 .cse3) (let ((.cse7 (+ ~st2~0 ~st1~0))) (and .cse5 .cse6 (<= .cse7 0) (<= 0 .cse7)))))) (and .cse4 .cse5 .cse3 (<= (+ ~st3~0 ~st1~0) 0) .cse1) (and .cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse3 .cse8 .cse1)))) [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L895 garLoopResultBuilder]: At program point L259(lines 165 260) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-10-16 16:20:48,716 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L895 garLoopResultBuilder]: At program point L375(lines 363 376) the Hoare annotation is: (let ((.cse12 (+ ~st2~0 ~st1~0))) (let ((.cse6 (<= ~st3~0 0)) (.cse4 (<= 0 ~st3~0)) (.cse10 (<= ~st1~0 0)) (.cse2 (<= 0 ~st1~0)) (.cse3 (<= 0 .cse12)) (.cse11 (= ~st3~0 1)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= ~st2~0 0)) (.cse5 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0))) (or (and .cse0 .cse1 .cse2 (<= (+ ~st3~0 ~st1~0) 0) .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse4) (let ((.cse9 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse9) .cse1 .cse10 (<= .cse9 0) .cse8 .cse3)) (and .cse11 (or (and .cse0 .cse1 .cse10 .cse2 .cse3) (and .cse1 .cse10 .cse2 (<= .cse12 0) .cse3))) (and .cse11 (or (and .cse5 .cse1 .cse7 .cse8) (and .cse5 .cse0 .cse1)))))) [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-10-16 16:20:48,717 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 356) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse3 (<= ~st2~0 0)) (.cse5 (<= ~st1~0 0)) (.cse1 (<= 0 ~st2~0)) (.cse2 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0)) (.cse8 (= ~st2~0 1)) (.cse9 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0)) (.cse10 (<= 0 ~st1~0)) (.cse7 (<= 0 ~st3~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse5 (<= .cse4 0) .cse3 (<= 0 .cse6))) (and .cse0 (<= ~st3~0 0) .cse1 .cse3 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse2) (and .cse9 .cse10 .cse1 .cse2 (<= .cse6 0)) (and .cse8 .cse9 .cse10 (<= (+ ~st3~0 ~st1~0) 0) .cse7))) [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,718 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-10-16 16:20:48,719 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse10 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (let ((.cse4 (and .cse0 .cse10 .cse1)) (.cse3 (<= ~st2~0 0)) (.cse2 (<= 0 ~st2~0)) (.cse5 (<= ~st1~0 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (or (and .cse10 .cse1) (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse1 (<= .cse11 0) (<= 0 .cse11))))) (.cse9 (= ~st3~0 1))) (or (and (<= ~st3~0 0) (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (<= 0 ~st3~0)) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and .cse5 (<= 0 .cse6) .cse7 .cse8 (<= .cse6 0))) (and (or .cse4 (and .cse0 .cse1 .cse3)) .cse2 .cse9) (and .cse5 .cse7 .cse8 .cse9)))) [2022-10-16 16:20:48,719 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: (let ((.cse8 (<= 0 ~st2~0)) (.cse4 (= ~st2~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0))) (let ((.cse0 (let ((.cse9 (= ~st1~0 1))) (or (and .cse9 .cse5 .cse8 (<= ~st2~0 0)) (and .cse9 .cse4 .cse5)))) (.cse2 (= ~st3~0 1)) (.cse3 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st3~0))) (or (and (<= ~st3~0 0) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2 (let ((.cse6 (<= ~st1~0 0))) (or (and .cse4 .cse5 .cse6 .cse3) (let ((.cse7 (+ ~st2~0 ~st1~0))) (and .cse5 .cse6 (<= .cse7 0) (<= 0 .cse7)))))) (and .cse4 .cse5 .cse3 (<= (+ ~st3~0 ~st1~0) 0) .cse1) (and .cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse3 .cse8 .cse1)))) [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,720 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-10-16 16:20:48,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-16 16:20:48,722 INFO L895 garLoopResultBuilder]: At program point L380(lines 361 381) the Hoare annotation is: (let ((.cse12 (+ ~st2~0 ~st1~0))) (let ((.cse6 (<= ~st3~0 0)) (.cse4 (<= 0 ~st3~0)) (.cse10 (<= ~st1~0 0)) (.cse2 (<= 0 ~st1~0)) (.cse3 (<= 0 .cse12)) (.cse11 (= ~st3~0 1)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= ~st2~0 0)) (.cse5 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0))) (or (and .cse0 .cse1 .cse2 (<= (+ ~st3~0 ~st1~0) 0) .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse4) (let ((.cse9 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse9) .cse1 .cse10 (<= .cse9 0) .cse8 .cse3)) (and .cse11 (or (and .cse0 .cse1 .cse10 .cse2 .cse3) (and .cse1 .cse10 .cse2 (<= .cse12 0) .cse3))) (and .cse11 (or (and .cse5 .cse1 .cse7 .cse8) (and .cse5 .cse0 .cse1)))))) [2022-10-16 16:20:48,722 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-10-16 16:20:48,722 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-10-16 16:20:48,722 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-10-16 16:20:48,722 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-10-16 16:20:48,722 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2022-10-16 16:20:48,723 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-10-16 16:20:48,723 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2022-10-16 16:20:48,727 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:20:48,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 16:20:48,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:20:48 BoogieIcfgContainer [2022-10-16 16:20:48,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 16:20:48,778 INFO L158 Benchmark]: Toolchain (without parser) took 181621.51ms. Allocated memory was 166.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-16 16:20:48,778 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 166.7MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 16:20:48,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.08ms. Allocated memory is still 166.7MB. Free memory was 117.5MB in the beginning and 146.6MB in the end (delta: -29.0MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-10-16 16:20:48,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.45ms. Allocated memory is still 166.7MB. Free memory was 146.6MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 16:20:48,779 INFO L158 Benchmark]: Boogie Preprocessor took 57.25ms. Allocated memory is still 166.7MB. Free memory was 144.6MB in the beginning and 143.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 16:20:48,779 INFO L158 Benchmark]: RCFGBuilder took 869.56ms. Allocated memory is still 166.7MB. Free memory was 142.5MB in the beginning and 122.0MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-16 16:20:48,780 INFO L158 Benchmark]: TraceAbstraction took 180060.57ms. Allocated memory was 166.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 121.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-16 16:20:48,781 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 166.7MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.08ms. Allocated memory is still 166.7MB. Free memory was 117.5MB in the beginning and 146.6MB in the end (delta: -29.0MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.45ms. Allocated memory is still 166.7MB. Free memory was 146.6MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.25ms. Allocated memory is still 166.7MB. Free memory was 144.6MB in the beginning and 143.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 869.56ms. Allocated memory is still 166.7MB. Free memory was 142.5MB in the beginning and 122.0MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 180060.57ms. Allocated memory was 166.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 121.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. 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: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 89 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 179.9s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 134.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6405 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6405 mSDsluCounter, 12592 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6675 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3827 IncrementalHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 5917 mSDtfsCounter, 3827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14234occurred in iteration=22, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 10699 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 2103 NumberOfFragments, 2235 HoareAnnotationTreeSize, 17 FomulaSimplifications, 214521 FormulaSimplificationTreeSizeReduction, 78.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 731155 FormulaSimplificationTreeSizeReductionInter, 56.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2508 NumberOfCodeBlocks, 2508 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2473 ConstructedInterpolants, 0 QuantifiedInterpolants, 9727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 746/746 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 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((st3 <= 0 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2))) && 0 <= st3) || (st3 == 1 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2)))) || ((0 <= st1 && st3 == 1) && ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && st1 <= 0) && 0 <= st1) || (((256 * (mode2 / 256) == mode2 && st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((256 * (mode2 / 256) == mode2 && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((st1 <= 0 && st3 == 1) && ((st2 == 1 && 0 <= st1) || ((0 <= st1 && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st2 == 1 && r1 / 256 * 256 + 2 < r1) && st1 <= 0) && 0 <= st1) && st3 == 1)) || ((((r1 / 256 * 256 + 2 < r1 && 0 <= st1) && 0 <= st2) && st3 == 1) && st2 + st1 <= 0)) || ((((st2 == 1 && r1 / 256 * 256 + 2 < r1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((st3 <= 0 && ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3))) && 0 <= st3) || ((((st1 <= 0 && 0 <= st3 + st1) && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 + st1 <= 0)) || (((((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3) || ((st1 == 1 && 256 * (mode3 / 256) == mode3) && st2 <= 0)) && 0 <= st2) && st3 == 1)) || (((st1 <= 0 && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || (((((st1 == 1 && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3)) || (((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || ((((256 * (mode1 / 256) == mode1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((st3 <= 0 && ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3))) && 0 <= st3) || ((((st1 <= 0 && 0 <= st3 + st1) && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 + st1 <= 0)) || (((((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3) || ((st1 == 1 && 256 * (mode3 / 256) == mode3) && st2 <= 0)) && 0 <= st2) && st3 == 1)) || (((st1 <= 0 && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 == 1) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || (((((st1 == 1 && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3)) || (((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || ((((256 * (mode1 / 256) == mode1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((st3 <= 0 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2))) && 0 <= st3) || (st3 == 1 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2)))) || ((0 <= st1 && st3 == 1) && ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && st1 <= 0) && 0 <= st1) || (((256 * (mode2 / 256) == mode2 && st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((256 * (mode2 / 256) == mode2 && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-10-16 16:20:48,864 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...