/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-fpi/res1f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:44:34,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:44:34,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:44:34,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:44:34,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:44:34,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:44:34,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:44:34,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:44:34,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:44:34,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:44:34,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:44:34,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:44:34,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:44:34,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:44:34,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:44:34,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:44:34,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:44:34,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:44:34,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:44:34,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:44:34,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:44:34,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:44:34,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:44:34,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:44:34,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:44:34,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:44:34,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:44:34,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:44:34,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:44:34,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:44:34,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:44:34,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:44:34,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:44:34,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:44:34,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:44:34,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:44:34,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:44:34,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:44:34,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:44:34,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:44:34,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:44:34,662 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 10:44:34,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:44:34,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:44:34,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:44:34,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:44:34,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:44:34,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:44:34,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:44:34,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:44:34,727 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:44:34,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:44:34,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:44:34,729 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:44:34,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:44:34,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:44:34,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:44:34,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:44:34,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:44:34,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:44:34,731 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:44:34,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:44:34,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:44:34,732 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:44:34,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:44:34,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:44:34,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:44:34,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:44:34,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:44:34,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:44:34,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:44:34,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:44:34,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:44:34,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:44:34,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:44:34,735 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 10:44:35,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:44:35,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:44:35,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:44:35,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:44:35,196 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:44:35,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res1f.c [2022-10-16 10:44:35,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6778deb48/a8847d066bd54c94bec3011fdf44b351/FLAGd81fe41ce [2022-10-16 10:44:35,841 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:44:35,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1f.c [2022-10-16 10:44:35,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6778deb48/a8847d066bd54c94bec3011fdf44b351/FLAGd81fe41ce [2022-10-16 10:44:36,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6778deb48/a8847d066bd54c94bec3011fdf44b351 [2022-10-16 10:44:36,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:44:36,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:44:36,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:44:36,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:44:36,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:44:36,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b9193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36, skipping insertion in model container [2022-10-16 10:44:36,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:44:36,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:44:36,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1f.c[588,601] [2022-10-16 10:44:36,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:44:36,568 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:44:36,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1f.c[588,601] [2022-10-16 10:44:36,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:44:36,633 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:44:36,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36 WrapperNode [2022-10-16 10:44:36,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:44:36,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:44:36,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:44:36,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:44:36,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,689 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2022-10-16 10:44:36,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:44:36,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:44:36,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:44:36,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:44:36,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,718 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:44:36,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:44:36,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:44:36,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:44:36,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (1/1) ... [2022-10-16 10:44:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:44:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:36,766 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 10:44:36,784 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 10:44:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:44:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:44:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:44:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:44:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:44:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:44:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:44:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:44:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:44:36,928 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:44:36,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:44:37,184 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:44:37,206 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:44:37,206 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 10:44:37,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:44:37 BoogieIcfgContainer [2022-10-16 10:44:37,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:44:37,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:44:37,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:44:37,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:44:37,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:44:36" (1/3) ... [2022-10-16 10:44:37,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e69c2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:44:37, skipping insertion in model container [2022-10-16 10:44:37,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:44:36" (2/3) ... [2022-10-16 10:44:37,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e69c2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:44:37, skipping insertion in model container [2022-10-16 10:44:37,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:44:37" (3/3) ... [2022-10-16 10:44:37,240 INFO L112 eAbstractionObserver]: Analyzing ICFG res1f.c [2022-10-16 10:44:37,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:44:37,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-16 10:44:37,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:44:37,390 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;@17171d0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:44:37,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-16 10:44:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 50 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 10:44:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:44:37,403 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:37,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:37,405 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 10:44:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:44:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:37,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029531733] [2022-10-16 10:44:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:37,695 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 10:44:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:37,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029531733] [2022-10-16 10:44:37,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029531733] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:37,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:37,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:44:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933567617] [2022-10-16 10:44:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:44:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:37,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:44:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:44:37,762 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 50 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 10:44:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:37,793 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2022-10-16 10:44:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:44:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 10:44:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:37,807 INFO L225 Difference]: With dead ends: 98 [2022-10-16 10:44:37,808 INFO L226 Difference]: Without dead ends: 45 [2022-10-16 10:44:37,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:44:37,821 INFO L413 NwaCegarLoop]: 55 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, 55 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 10:44:37,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-16 10:44:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-16 10:44:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 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 10:44:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-10-16 10:44:37,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 8 [2022-10-16 10:44:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:37,878 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-10-16 10:44:37,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 10:44:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-10-16 10:44:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:44:37,880 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:37,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:37,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:44:37,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:44:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:37,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062237514] [2022-10-16 10:44:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:38,163 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 10:44:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062237514] [2022-10-16 10:44:38,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062237514] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:38,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:38,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:44:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241798865] [2022-10-16 10:44:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:38,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:44:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:44:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:44:38,168 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 10:44:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:38,276 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-10-16 10:44:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:44:38,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 10:44:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:38,279 INFO L225 Difference]: With dead ends: 85 [2022-10-16 10:44:38,279 INFO L226 Difference]: Without dead ends: 83 [2022-10-16 10:44:38,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:44:38,281 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:38,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 92 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-16 10:44:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2022-10-16 10:44:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-10-16 10:44:38,292 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 8 [2022-10-16 10:44:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:38,292 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-10-16 10:44:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 10:44:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-10-16 10:44:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:44:38,293 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:38,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:38,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:44:38,294 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 10:44:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:38,295 INFO L85 PathProgramCache]: Analyzing trace with hash 678258679, now seen corresponding path program 1 times [2022-10-16 10:44:38,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:38,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49576614] [2022-10-16 10:44:38,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:38,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:38,460 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 10:44:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:38,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49576614] [2022-10-16 10:44:38,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49576614] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:38,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:38,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:44:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324930393] [2022-10-16 10:44:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:38,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:44:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:44:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:44:38,466 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:38,588 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2022-10-16 10:44:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:44:38,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 10:44:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:38,590 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:44:38,590 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 10:44:38,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:44:38,593 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:38,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 54 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 10:44:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2022-10-16 10:44:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-10-16 10:44:38,613 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 10 [2022-10-16 10:44:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:38,614 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-10-16 10:44:38,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-10-16 10:44:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:44:38,615 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:38,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:38,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:44:38,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:44:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:38,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852121266] [2022-10-16 10:44:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:38,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:38,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852121266] [2022-10-16 10:44:38,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852121266] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:38,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829938169] [2022-10-16 10:44:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:38,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:38,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:38,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 10:44:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:38,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:44:38,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:39,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829938169] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:39,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:39,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:44:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609066132] [2022-10-16 10:44:39,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:39,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:44:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:44:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:44:39,101 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:44:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:39,325 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-10-16 10:44:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:44:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 10:44:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:39,336 INFO L225 Difference]: With dead ends: 92 [2022-10-16 10:44:39,336 INFO L226 Difference]: Without dead ends: 91 [2022-10-16 10:44:39,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:44:39,347 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 91 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:39,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 232 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-16 10:44:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2022-10-16 10:44:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 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 10:44:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-10-16 10:44:39,373 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 12 [2022-10-16 10:44:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:39,373 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-10-16 10:44:39,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:44:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-10-16 10:44:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:44:39,377 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:39,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:39,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:39,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:39,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:44:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:39,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207663468] [2022-10-16 10:44:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:39,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:39,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207663468] [2022-10-16 10:44:39,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207663468] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:39,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324369364] [2022-10-16 10:44:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:39,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 10:44:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:44:39,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:39,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:44:39,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324369364] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:39,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:44:39,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:44:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141431081] [2022-10-16 10:44:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:44:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:44:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:44:39,852 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 10:44:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:39,924 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-10-16 10:44:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:44:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-10-16 10:44:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:39,926 INFO L225 Difference]: With dead ends: 84 [2022-10-16 10:44:39,926 INFO L226 Difference]: Without dead ends: 83 [2022-10-16 10:44:39,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:44:39,928 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:39,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-16 10:44:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2022-10-16 10:44:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.375) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 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 10:44:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-10-16 10:44:39,938 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2022-10-16 10:44:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:39,939 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-10-16 10:44:39,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 10:44:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-10-16 10:44:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:44:39,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:39,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:39,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:40,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:40,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash -825622541, now seen corresponding path program 1 times [2022-10-16 10:44:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:40,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521405153] [2022-10-16 10:44:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521405153] [2022-10-16 10:44:40,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521405153] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:40,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:40,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:44:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718789031] [2022-10-16 10:44:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:40,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:44:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:44:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:44:40,218 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:40,268 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-10-16 10:44:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:44:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:44:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:40,269 INFO L225 Difference]: With dead ends: 83 [2022-10-16 10:44:40,270 INFO L226 Difference]: Without dead ends: 81 [2022-10-16 10:44:40,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:44:40,271 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:40,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-10-16 10:44:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2022-10-16 10:44:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 62 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 10:44:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-10-16 10:44:40,280 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 14 [2022-10-16 10:44:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:40,280 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-10-16 10:44:40,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-10-16 10:44:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 10:44:40,282 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:40,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:40,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:44:40,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1496738415, now seen corresponding path program 1 times [2022-10-16 10:44:40,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:40,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777732083] [2022-10-16 10:44:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:40,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777732083] [2022-10-16 10:44:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777732083] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:40,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5782526] [2022-10-16 10:44:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:40,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:40,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:40,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 10:44:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:40,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:44:40,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:40,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5782526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:40,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:40,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:44:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788100274] [2022-10-16 10:44:40,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:40,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:44:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:44:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:44:40,647 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 10:44:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:40,917 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-10-16 10:44:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:44:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 18 [2022-10-16 10:44:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:40,919 INFO L225 Difference]: With dead ends: 170 [2022-10-16 10:44:40,919 INFO L226 Difference]: Without dead ends: 135 [2022-10-16 10:44:40,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:44:40,921 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 192 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:40,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 262 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:44:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-16 10:44:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2022-10-16 10:44:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 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 10:44:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-10-16 10:44:40,931 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 18 [2022-10-16 10:44:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:40,932 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-10-16 10:44:40,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 10:44:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-10-16 10:44:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 10:44:40,933 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:40,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:40,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-16 10:44:41,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:41,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -845800761, now seen corresponding path program 1 times [2022-10-16 10:44:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:41,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605133936] [2022-10-16 10:44:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605133936] [2022-10-16 10:44:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605133936] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402439153] [2022-10-16 10:44:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:41,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:41,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 10:44:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:41,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:44:41,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:41,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:44:41,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:44:41,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:44:42,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:44:42,126 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 10:44:42,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:44:42,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:44:42,369 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:44:42,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-10-16 10:44:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:42,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:42,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402439153] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:42,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:42,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-10-16 10:44:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268705331] [2022-10-16 10:44:42,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:42,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 10:44:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 10:44:42,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:44:42,616 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 10:44:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:43,081 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-10-16 10:44:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:44:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 19 [2022-10-16 10:44:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:43,082 INFO L225 Difference]: With dead ends: 97 [2022-10-16 10:44:43,083 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 10:44:43,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:44:43,084 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:43,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 252 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 127 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-10-16 10:44:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 10:44:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-10-16 10:44:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 93 states have internal predecessors, (112), 0 states have call successors, (0), 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 10:44:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2022-10-16 10:44:43,097 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 19 [2022-10-16 10:44:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:43,097 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2022-10-16 10:44:43,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 10:44:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2022-10-16 10:44:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 10:44:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:43,099 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] [2022-10-16 10:44:43,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:43,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:43,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1322746103, now seen corresponding path program 1 times [2022-10-16 10:44:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178683622] [2022-10-16 10:44:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:43,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178683622] [2022-10-16 10:44:43,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178683622] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:43,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:44:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107991598] [2022-10-16 10:44:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:44:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:44:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:44:43,374 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 10:44:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:43,423 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-10-16 10:44:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:44:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 10:44:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:43,425 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:44:43,425 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 10:44:43,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:44:43,426 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:43,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 10:44:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2022-10-16 10:44:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 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 10:44:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-10-16 10:44:43,438 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 22 [2022-10-16 10:44:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:43,439 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-10-16 10:44:43,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 10:44:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-10-16 10:44:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:44:43,440 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:43,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 10:44:43,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1488947009, now seen corresponding path program 1 times [2022-10-16 10:44:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500055277] [2022-10-16 10:44:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:44:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500055277] [2022-10-16 10:44:43,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500055277] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095269621] [2022-10-16 10:44:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:43,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:43,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:43,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 10:44:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:43,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:44:43,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:44:43,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:44:43,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095269621] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:43,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:44:43,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:44:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130955670] [2022-10-16 10:44:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:43,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:44:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:44:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:44:43,648 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 10:44:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:43,715 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2022-10-16 10:44:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:44:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 10:44:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:43,717 INFO L225 Difference]: With dead ends: 119 [2022-10-16 10:44:43,717 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 10:44:43,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:44:43,718 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:43,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 10:44:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2022-10-16 10:44:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 100 states have internal predecessors, (120), 0 states have call successors, (0), 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 10:44:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2022-10-16 10:44:43,729 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 23 [2022-10-16 10:44:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:43,730 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2022-10-16 10:44:43,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 10:44:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2022-10-16 10:44:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:44:43,731 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:43,731 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:43,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:43,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 10:44:43,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:44:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:43,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711540825] [2022-10-16 10:44:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:44,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711540825] [2022-10-16 10:44:44,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711540825] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:44,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305083615] [2022-10-16 10:44:44,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:44:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:44,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 10:44:44,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:44:44,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:44:44,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:44:44,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:44:44,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:44:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305083615] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:44,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:44:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561784494] [2022-10-16 10:44:44,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:44,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:44:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:44:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:44:44,275 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 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 10:44:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:44,513 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2022-10-16 10:44:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:44:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:44:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:44,515 INFO L225 Difference]: With dead ends: 128 [2022-10-16 10:44:44,515 INFO L226 Difference]: Without dead ends: 127 [2022-10-16 10:44:44,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:44:44,517 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 142 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:44,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-10-16 10:44:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2022-10-16 10:44:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.3375) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 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 10:44:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2022-10-16 10:44:44,527 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 24 [2022-10-16 10:44:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:44,527 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2022-10-16 10:44:44,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 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 10:44:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-10-16 10:44:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:44:44,528 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:44,528 INFO L195 NwaCegarLoop]: trace histogram [2, 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 10:44:44,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:44,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:44,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash -395689331, now seen corresponding path program 1 times [2022-10-16 10:44:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:44,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127570181] [2022-10-16 10:44:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:44,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127570181] [2022-10-16 10:44:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127570181] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631039050] [2022-10-16 10:44:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:44,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:44,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 10:44:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:44,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:44:44,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:45,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631039050] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:45,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:45,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:44:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781683887] [2022-10-16 10:44:45,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:45,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:44:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:45,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:44:45,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:44:45,113 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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 10:44:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:45,326 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2022-10-16 10:44:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:44:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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 25 [2022-10-16 10:44:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:45,328 INFO L225 Difference]: With dead ends: 160 [2022-10-16 10:44:45,328 INFO L226 Difference]: Without dead ends: 139 [2022-10-16 10:44:45,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:44:45,329 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:45,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 255 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-10-16 10:44:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2022-10-16 10:44:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 97 states have internal predecessors, (115), 0 states have call successors, (0), 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 10:44:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2022-10-16 10:44:45,341 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 25 [2022-10-16 10:44:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:45,341 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2022-10-16 10:44:45,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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 10:44:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-10-16 10:44:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:44:45,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:45,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:45,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:45,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:45,557 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1201818393, now seen corresponding path program 2 times [2022-10-16 10:44:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:45,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749026230] [2022-10-16 10:44:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749026230] [2022-10-16 10:44:45,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749026230] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:45,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676490181] [2022-10-16 10:44:45,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:44:45,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:45,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:45,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 10:44:45,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:44:45,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:44:45,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:44:45,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:44:45,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:44:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676490181] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:45,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:45,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:44:45,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968568575] [2022-10-16 10:44:45,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:45,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:44:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:44:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:44:45,897 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 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 10:44:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:46,261 INFO L93 Difference]: Finished difference Result 235 states and 277 transitions. [2022-10-16 10:44:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:44:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 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 26 [2022-10-16 10:44:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:46,263 INFO L225 Difference]: With dead ends: 235 [2022-10-16 10:44:46,264 INFO L226 Difference]: Without dead ends: 196 [2022-10-16 10:44:46,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:44:46,266 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 253 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:46,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 212 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-10-16 10:44:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 115. [2022-10-16 10:44:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 114 states have internal predecessors, (135), 0 states have call successors, (0), 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 10:44:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-10-16 10:44:46,277 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 26 [2022-10-16 10:44:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:46,277 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-10-16 10:44:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 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 10:44:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-10-16 10:44:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:44:46,279 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:46,279 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] [2022-10-16 10:44:46,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-16 10:44:46,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:44:46,493 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1994597725, now seen corresponding path program 1 times [2022-10-16 10:44:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:46,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796141705] [2022-10-16 10:44:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:46,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796141705] [2022-10-16 10:44:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796141705] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129612947] [2022-10-16 10:44:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:47,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:47,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:47,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 10:44:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:47,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-16 10:44:47,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:47,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:44:47,725 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:44:47,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-10-16 10:44:47,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:44:47,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:44:48,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-10-16 10:44:48,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-10-16 10:44:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:48,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:49,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129612947] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:49,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-10-16 10:44:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741016122] [2022-10-16 10:44:49,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:49,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:44:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:44:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:44:49,287 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 10:44:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:50,226 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2022-10-16 10:44:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:44:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 27 [2022-10-16 10:44:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:50,228 INFO L225 Difference]: With dead ends: 136 [2022-10-16 10:44:50,228 INFO L226 Difference]: Without dead ends: 135 [2022-10-16 10:44:50,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:44:50,230 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:50,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 324 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 131 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2022-10-16 10:44:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-16 10:44:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2022-10-16 10:44:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 125 states have internal predecessors, (147), 0 states have call successors, (0), 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 10:44:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-10-16 10:44:50,245 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 27 [2022-10-16 10:44:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:50,246 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-10-16 10:44:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 10:44:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-10-16 10:44:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:44:50,247 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:50,247 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] [2022-10-16 10:44:50,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:50,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 10:44:50,464 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1702987445, now seen corresponding path program 1 times [2022-10-16 10:44:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:50,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504822589] [2022-10-16 10:44:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:44:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504822589] [2022-10-16 10:44:51,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504822589] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872023519] [2022-10-16 10:44:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:51,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:51,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:44:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:51,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 10:44:51,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:51,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:44:51,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:44:51,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:44:51,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:44:51,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:44:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:51,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:55,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2022-10-16 10:44:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:44:56,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872023519] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:56,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:56,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-10-16 10:44:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094888491] [2022-10-16 10:44:56,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:56,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:44:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:44:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=405, Unknown=5, NotChecked=0, Total=506 [2022-10-16 10:44:56,619 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 10:44:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:57,333 INFO L93 Difference]: Finished difference Result 179 states and 213 transitions. [2022-10-16 10:44:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:44:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-10-16 10:44:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:57,335 INFO L225 Difference]: With dead ends: 179 [2022-10-16 10:44:57,335 INFO L226 Difference]: Without dead ends: 176 [2022-10-16 10:44:57,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=271, Invalid=984, Unknown=5, NotChecked=0, Total=1260 [2022-10-16 10:44:57,337 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:57,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 236 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 210 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-10-16 10:44:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-16 10:44:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2022-10-16 10:44:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 119 states have internal predecessors, (139), 0 states have call successors, (0), 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 10:44:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-10-16 10:44:57,355 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 28 [2022-10-16 10:44:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:57,355 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-10-16 10:44:57,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 10:44:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-10-16 10:44:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:44:57,356 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:57,356 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] [2022-10-16 10:44:57,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:57,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:44:57,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1409495825, now seen corresponding path program 2 times [2022-10-16 10:44:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495198632] [2022-10-16 10:44:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:57,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495198632] [2022-10-16 10:44:57,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495198632] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:57,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082259264] [2022-10-16 10:44:57,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:44:57,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:57,707 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:57,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:44:57,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:44:57,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:44:57,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:44:57,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:57,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082259264] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:57,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:57,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:44:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849674225] [2022-10-16 10:44:57,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:44:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:44:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:44:57,939 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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 10:44:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:58,202 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2022-10-16 10:44:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:44:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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 29 [2022-10-16 10:44:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:58,203 INFO L225 Difference]: With dead ends: 182 [2022-10-16 10:44:58,204 INFO L226 Difference]: Without dead ends: 140 [2022-10-16 10:44:58,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:44:58,205 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:58,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 312 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:44:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-10-16 10:44:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2022-10-16 10:44:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 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 10:44:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2022-10-16 10:44:58,222 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 29 [2022-10-16 10:44:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:58,223 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-10-16 10:44:58,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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 10:44:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2022-10-16 10:44:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:44:58,224 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:58,224 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] [2022-10-16 10:44:58,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:58,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:44:58,438 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 188398583, now seen corresponding path program 1 times [2022-10-16 10:44:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355675263] [2022-10-16 10:44:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:44:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:58,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355675263] [2022-10-16 10:44:58,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355675263] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:44:58,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:44:58,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:44:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722224332] [2022-10-16 10:44:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:44:58,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:44:58,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:44:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:44:58,520 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:58,570 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2022-10-16 10:44:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:44:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 10:44:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:58,572 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:44:58,572 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 10:44:58,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:44:58,574 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:58,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 84 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:44:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 10:44:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-10-16 10:44:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 117 states have internal predecessors, (134), 0 states have call successors, (0), 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 10:44:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2022-10-16 10:44:58,589 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 30 [2022-10-16 10:44:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:58,590 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2022-10-16 10:44:58,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-10-16 10:44:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:44:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:58,591 INFO L195 NwaCegarLoop]: trace histogram [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 10:44:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 10:44:58,591 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:44:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -939950877, now seen corresponding path program 1 times [2022-10-16 10:44:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944835031] [2022-10-16 10:44:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:44:58,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944835031] [2022-10-16 10:44:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944835031] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:44:58,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352086033] [2022-10-16 10:44:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:58,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:44:58,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:44:58,740 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:44:58,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:44:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:44:58,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:44:58,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:44:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:58,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:44:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:44:58,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352086033] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:44:58,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:44:58,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:44:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952820226] [2022-10-16 10:44:58,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:44:58,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:44:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:44:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:44:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:44:58,985 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:44:59,169 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2022-10-16 10:44:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:44:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:44:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:44:59,171 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:44:59,171 INFO L226 Difference]: Without dead ends: 102 [2022-10-16 10:44:59,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-10-16 10:44:59,172 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 80 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:44:59,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 173 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:44:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-16 10:44:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-10-16 10:44:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:44:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2022-10-16 10:44:59,185 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 33 [2022-10-16 10:44:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:44:59,185 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2022-10-16 10:44:59,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:44:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2022-10-16 10:44:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:44:59,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:44:59,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:44:59,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:44:59,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:44:59,400 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 10:44:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:44:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1206436117, now seen corresponding path program 3 times [2022-10-16 10:44:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:44:59,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668233578] [2022-10-16 10:44:59,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:44:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:44:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:45:00,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:00,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668233578] [2022-10-16 10:45:00,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668233578] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:00,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485805127] [2022-10-16 10:45:00,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:45:00,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:00,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:00,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:00,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:45:00,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:45:00,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:45:00,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-16 10:45:00,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:00,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:45:00,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:00,762 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:45:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 10:45:00,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:45:01,003 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:45:01,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:45:01,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:01,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:45:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:01,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:45:01,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:45:01,861 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:45:01,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:45:02,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:02,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:45:02,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2022-10-16 10:45:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:45:02,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:02,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (not (< |v_ULTIMATE.start_main_~i~0#1_83| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) is different from false [2022-10-16 10:45:03,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_83| 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) is different from false [2022-10-16 10:45:03,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) is different from false [2022-10-16 10:45:03,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) is different from false [2022-10-16 10:45:03,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |v_ULTIMATE.start_main_~i~0#1_89| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1) (< (+ v_ArrVal_591 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_89| (+ |c_ULTIMATE.start_main_#t~post7#1| 1))))) is different from false [2022-10-16 10:45:03,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|) (< |v_ULTIMATE.start_main_~i~0#1_89| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1) (< (+ v_ArrVal_591 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) is different from false [2022-10-16 10:45:03,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|) (< |v_ULTIMATE.start_main_~i~0#1_89| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) is different from false [2022-10-16 10:45:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-10-16 10:45:03,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485805127] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:03,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:03,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2022-10-16 10:45:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84622735] [2022-10-16 10:45:03,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:03,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 10:45:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 10:45:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1257, Unknown=10, NotChecked=546, Total=1980 [2022-10-16 10:45:03,501 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 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 10:45:04,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse3 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse3 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|) (< |v_ULTIMATE.start_main_~i~0#1_89| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1) (< (+ v_ArrVal_591 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))))) is different from false [2022-10-16 10:45:06,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_#t~post7#1| 0) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_#t~post7#1| 0) (<= .cse1 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< |v_ULTIMATE.start_main_~i~0#1_89| |v_ULTIMATE.start_main_~i~0#1_83|) (< |v_ULTIMATE.start_main_~i~0#1_83| 1) (< (+ v_ArrVal_591 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_89| (+ |c_ULTIMATE.start_main_#t~post7#1| 1))))))) is different from false [2022-10-16 10:45:07,576 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (< (+ v_ArrVal_591 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (not (< |v_ULTIMATE.start_main_~i~0#1_83| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_83| 1)))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_591 Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_590))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_591 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_591)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_591) (not (< |v_ULTIMATE.start_main_~i~0#1_83| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_83| 1)))))) is different from false [2022-10-16 10:45:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:09,560 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2022-10-16 10:45:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-16 10:45:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 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 33 [2022-10-16 10:45:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:09,562 INFO L225 Difference]: With dead ends: 133 [2022-10-16 10:45:09,562 INFO L226 Difference]: Without dead ends: 132 [2022-10-16 10:45:09,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=322, Invalid=2460, Unknown=14, NotChecked=1110, Total=3906 [2022-10-16 10:45:09,565 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:09,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 369 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 297 Unchecked, 0.1s Time] [2022-10-16 10:45:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-10-16 10:45:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-10-16 10:45:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 123 states have (on average 1.2601626016260163) internal successors, (155), 131 states have internal predecessors, (155), 0 states have call successors, (0), 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 10:45:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-10-16 10:45:09,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 33 [2022-10-16 10:45:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:09,583 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-10-16 10:45:09,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 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 10:45:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-10-16 10:45:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:45:09,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:09,584 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] [2022-10-16 10:45:09,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:09,800 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 10:45:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1255185945, now seen corresponding path program 1 times [2022-10-16 10:45:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:09,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909438399] [2022-10-16 10:45:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:45:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:10,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909438399] [2022-10-16 10:45:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909438399] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903741366] [2022-10-16 10:45:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:10,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:10,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:10,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:45:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:10,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:45:10,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:10,582 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:45:10,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2022-10-16 10:45:10,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:45:10,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:45:10,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:45:10,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:45:11,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:45:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:45:11,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:12,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (< 0 (+ v_ArrVal_643 9223372036854775809 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_643)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< (+ v_ArrVal_643 9223372036854775808) 0))) is different from false [2022-10-16 10:45:13,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_641 (Array Int Int))) (or (< (+ v_ArrVal_643 9223372036854775808) 0) (< 0 (+ v_ArrVal_643 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_641))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_643))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 9223372036854775809)))) is different from false [2022-10-16 10:45:14,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:45:14,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2022-10-16 10:45:14,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:45:14,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 352 [2022-10-16 10:45:14,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 374 [2022-10-16 10:45:14,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 210 [2022-10-16 10:45:14,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:45:14,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 282 [2022-10-16 10:45:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-10-16 10:45:14,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903741366] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:14,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:14,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-10-16 10:45:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620196793] [2022-10-16 10:45:14,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:14,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:45:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:45:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=667, Unknown=2, NotChecked=106, Total=870 [2022-10-16 10:45:14,472 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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 10:45:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:15,878 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-10-16 10:45:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:45:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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 34 [2022-10-16 10:45:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:15,880 INFO L225 Difference]: With dead ends: 149 [2022-10-16 10:45:15,880 INFO L226 Difference]: Without dead ends: 148 [2022-10-16 10:45:15,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=227, Invalid=1185, Unknown=2, NotChecked=146, Total=1560 [2022-10-16 10:45:15,882 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:15,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 398 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 281 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-10-16 10:45:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-16 10:45:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2022-10-16 10:45:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 131 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2022-10-16 10:45:15,900 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 34 [2022-10-16 10:45:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:15,900 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2022-10-16 10:45:15,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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 10:45:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2022-10-16 10:45:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 10:45:15,901 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:15,901 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] [2022-10-16 10:45:15,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:16,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:16,115 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -256106011, now seen corresponding path program 2 times [2022-10-16 10:45:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250645172] [2022-10-16 10:45:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250645172] [2022-10-16 10:45:16,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250645172] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530033023] [2022-10-16 10:45:16,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:45:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:16,260 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:16,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:45:16,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:45:16,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:45:16,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:45:16,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:16,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:16,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530033023] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:16,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:16,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:45:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919000028] [2022-10-16 10:45:16,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:45:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:45:16,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:45:16,539 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:16,846 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-10-16 10:45:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:45:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-16 10:45:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:16,847 INFO L225 Difference]: With dead ends: 176 [2022-10-16 10:45:16,847 INFO L226 Difference]: Without dead ends: 143 [2022-10-16 10:45:16,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:45:16,849 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 110 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:16,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 219 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:45:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-10-16 10:45:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2022-10-16 10:45:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2022-10-16 10:45:16,868 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 35 [2022-10-16 10:45:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2022-10-16 10:45:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2022-10-16 10:45:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:45:16,869 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:16,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:45:16,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:17,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:17,085 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 652120041, now seen corresponding path program 1 times [2022-10-16 10:45:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:17,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395281434] [2022-10-16 10:45:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:45:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395281434] [2022-10-16 10:45:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395281434] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824453425] [2022-10-16 10:45:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:17,176 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:17,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:45:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:17,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:45:17,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:45:17,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:45:17,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824453425] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:17,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:17,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:45:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183983524] [2022-10-16 10:45:17,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:17,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:45:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:45:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:45:17,334 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 10:45:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:17,473 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2022-10-16 10:45:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:45:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 10:45:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:17,475 INFO L225 Difference]: With dead ends: 175 [2022-10-16 10:45:17,475 INFO L226 Difference]: Without dead ends: 174 [2022-10-16 10:45:17,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:45:17,477 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 96 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:17,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 118 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:45:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-10-16 10:45:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2022-10-16 10:45:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 157 states have internal predecessors, (192), 0 states have call successors, (0), 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 10:45:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2022-10-16 10:45:17,496 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 36 [2022-10-16 10:45:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:17,497 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2022-10-16 10:45:17,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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 10:45:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2022-10-16 10:45:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 10:45:17,498 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:17,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:45:17,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:17,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 10:45:17,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1259115111, now seen corresponding path program 1 times [2022-10-16 10:45:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:17,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866846951] [2022-10-16 10:45:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:45:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866846951] [2022-10-16 10:45:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866846951] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022633728] [2022-10-16 10:45:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:17,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:17,793 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:17,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:45:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:17,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:45:17,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:45:17,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:45:17,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022633728] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:45:17,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:45:17,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:45:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971396053] [2022-10-16 10:45:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:45:17,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:45:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:45:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:45:17,917 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:45:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:17,996 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2022-10-16 10:45:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:45:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:45:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:17,997 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:45:17,997 INFO L226 Difference]: Without dead ends: 158 [2022-10-16 10:45:17,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:45:17,999 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:17,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:45:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-10-16 10:45:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-10-16 10:45:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 156 states have internal predecessors, (186), 0 states have call successors, (0), 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 10:45:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2022-10-16 10:45:18,019 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 37 [2022-10-16 10:45:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:18,019 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2022-10-16 10:45:18,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:45:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2022-10-16 10:45:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 10:45:18,020 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:18,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:45:18,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:18,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:18,236 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1534933533, now seen corresponding path program 2 times [2022-10-16 10:45:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:18,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567969361] [2022-10-16 10:45:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:45:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567969361] [2022-10-16 10:45:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567969361] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951489380] [2022-10-16 10:45:18,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:45:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:18,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:18,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:45:18,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:45:18,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:45:18,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:45:18,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:45:18,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:45:18,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951489380] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:18,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:18,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:45:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867880482] [2022-10-16 10:45:18,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:18,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:45:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:45:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:45:18,795 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:19,181 INFO L93 Difference]: Finished difference Result 242 states and 274 transitions. [2022-10-16 10:45:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:45:19,183 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-10-16 10:45:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:19,184 INFO L225 Difference]: With dead ends: 242 [2022-10-16 10:45:19,185 INFO L226 Difference]: Without dead ends: 180 [2022-10-16 10:45:19,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:45:19,187 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 174 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:19,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 379 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:45:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-10-16 10:45:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2022-10-16 10:45:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 164 states have internal predecessors, (194), 0 states have call successors, (0), 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 10:45:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2022-10-16 10:45:19,218 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 38 [2022-10-16 10:45:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:19,218 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2022-10-16 10:45:19,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:45:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2022-10-16 10:45:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:45:19,219 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:19,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:45:19,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:19,433 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1946178913, now seen corresponding path program 3 times [2022-10-16 10:45:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503760250] [2022-10-16 10:45:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:19,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503760250] [2022-10-16 10:45:19,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503760250] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:19,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144529314] [2022-10-16 10:45:19,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:45:19,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:19,623 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:19,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:45:19,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:45:19,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:45:19,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:45:19,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:19,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:45:19,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144529314] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:45:19,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:45:19,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:45:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702307710] [2022-10-16 10:45:19,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:45:19,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:45:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:45:19,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:45:19,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:45:19,986 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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 10:45:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:45:20,271 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2022-10-16 10:45:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:45:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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 40 [2022-10-16 10:45:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:45:20,273 INFO L225 Difference]: With dead ends: 191 [2022-10-16 10:45:20,274 INFO L226 Difference]: Without dead ends: 155 [2022-10-16 10:45:20,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:45:20,275 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 119 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:45:20,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 269 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:45:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-10-16 10:45:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2022-10-16 10:45:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 141 states have (on average 1.198581560283688) internal successors, (169), 148 states have internal predecessors, (169), 0 states have call successors, (0), 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 10:45:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2022-10-16 10:45:20,301 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 40 [2022-10-16 10:45:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:45:20,301 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2022-10-16 10:45:20,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 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 10:45:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2022-10-16 10:45:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:45:20,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:45:20,302 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 10:45:20,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 10:45:20,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:20,518 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:45:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:45:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash 201956779, now seen corresponding path program 3 times [2022-10-16 10:45:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:45:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770101060] [2022-10-16 10:45:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:45:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:45:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:45:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:45:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:45:22,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770101060] [2022-10-16 10:45:22,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770101060] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:45:22,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991637859] [2022-10-16 10:45:22,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:45:22,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:45:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:45:22,520 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:45:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:45:22,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:45:22,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:45:22,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 55 conjunts are in the unsatisfiable core [2022-10-16 10:45:22,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:45:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:22,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:45:22,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:45:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:22,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:45:22,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:22,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:22,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:45:23,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-10-16 10:45:23,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,415 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:45:23,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 10:45:23,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:45:23,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:23,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-10-16 10:45:24,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:24,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:24,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-10-16 10:45:24,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:24,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:45:24,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-10-16 10:45:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:45:24,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:45:27,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_929 Int) (v_ArrVal_931 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_929) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_929)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_929) v_ArrVal_931) (< (+ v_ArrVal_931 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) is different from false [2022-10-16 10:45:37,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_931 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_134| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_929) (< (+ v_ArrVal_931 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_929 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_929)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_931))))) is different from false [2022-10-16 10:46:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-10-16 10:46:20,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991637859] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:20,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:20,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 52 [2022-10-16 10:46:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140322788] [2022-10-16 10:46:20,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-16 10:46:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-16 10:46:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2238, Unknown=20, NotChecked=198, Total=2756 [2022-10-16 10:46:20,668 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 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 10:46:23,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse0 .cse7))) (and (= (select .cse0 0) 1) (<= .cse1 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse2 1) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_929 Int) (v_ArrVal_931 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_929) (< (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_929)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) v_ArrVal_929) v_ArrVal_931) (< (+ v_ArrVal_931 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse8 (+ .cse1 1)) (<= .cse8 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse8 1) (= .cse2 1)))) is different from false [2022-10-16 10:46:25,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse1 1) (= (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_929 Int) (v_ArrVal_931 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_929) (< (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_929)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) v_ArrVal_929) v_ArrVal_931) (< (+ v_ArrVal_931 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse2 0) 1) (<= .cse6 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse6 1) (= .cse1 1)))) is different from false [2022-10-16 10:46:28,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse0 .cse6))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< (+ .cse1 (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (<= .cse3 1) (= (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_929 Int) (v_ArrVal_931 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_929) (< (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_929)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) v_ArrVal_929) v_ArrVal_931) (< (+ v_ArrVal_931 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse2 0) 1) (<= .cse1 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 1) (= .cse3 1)))) is different from false [2022-10-16 10:46:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:28,840 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2022-10-16 10:46:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:46:28,840 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 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 41 [2022-10-16 10:46:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:28,845 INFO L225 Difference]: With dead ends: 166 [2022-10-16 10:46:28,845 INFO L226 Difference]: Without dead ends: 164 [2022-10-16 10:46:28,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 64.5s TimeCoverageRelationStatistics Valid=555, Invalid=3602, Unknown=23, NotChecked=650, Total=4830 [2022-10-16 10:46:28,847 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:28,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 465 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 385 Invalid, 0 Unknown, 488 Unchecked, 0.4s Time] [2022-10-16 10:46:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-10-16 10:46:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2022-10-16 10:46:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.205128205128205) internal successors, (141), 124 states have internal predecessors, (141), 0 states have call successors, (0), 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 10:46:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2022-10-16 10:46:28,868 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 41 [2022-10-16 10:46:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:28,868 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-10-16 10:46:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 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 10:46:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-10-16 10:46:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:46:28,869 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:28,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:28,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:29,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-16 10:46:29,083 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:46:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1311702111, now seen corresponding path program 4 times [2022-10-16 10:46:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918023586] [2022-10-16 10:46:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918023586] [2022-10-16 10:46:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918023586] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997093102] [2022-10-16 10:46:29,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:46:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:29,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:30,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 10:46:30,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:46:30,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:30,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:46:30,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:30,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-10-16 10:46:30,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:46:30,414 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:46:30,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:46:30,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:46:30,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:46:30,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:46:30,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:30,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:46:30,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:30,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:46:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:30,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:37,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int))) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-10-16 10:46:37,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_986)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-10-16 10:46:37,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_986)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-10-16 10:46:37,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_986)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:46:37,886 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:46:37,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 51 [2022-10-16 10:46:37,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:46:37,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 180 [2022-10-16 10:46:37,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2022-10-16 10:46:37,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2022-10-16 10:46:38,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:46:38,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 202 [2022-10-16 10:46:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 23 not checked. [2022-10-16 10:46:38,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997093102] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:38,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:38,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2022-10-16 10:46:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534787920] [2022-10-16 10:46:38,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:38,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:46:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:46:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1008, Unknown=4, NotChecked=268, Total=1406 [2022-10-16 10:46:38,346 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 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 10:46:40,456 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_986)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= .cse2 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 .cse2) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:46:42,461 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (select .cse1 .cse2))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_991 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_991 9223372036854775808) 0) (< 0 (+ v_ArrVal_991 9223372036854775809 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_986)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_990))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_991))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (<= 1 .cse3) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|) (= .cse3 1)))) is different from false [2022-10-16 10:46:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:43,460 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-10-16 10:46:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:46:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 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 42 [2022-10-16 10:46:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:43,461 INFO L225 Difference]: With dead ends: 127 [2022-10-16 10:46:43,461 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:46:43,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=271, Invalid=1909, Unknown=6, NotChecked=570, Total=2756 [2022-10-16 10:46:43,463 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:43,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 403 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 412 Invalid, 0 Unknown, 294 Unchecked, 0.3s Time] [2022-10-16 10:46:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:46:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-10-16 10:46:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 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 10:46:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-10-16 10:46:43,483 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 42 [2022-10-16 10:46:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:43,483 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-10-16 10:46:43,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 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 10:46:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-10-16 10:46:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:46:43,484 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:43,484 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 10:46:43,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-10-16 10:46:43,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 10:46:43,686 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:46:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1921778353, now seen corresponding path program 2 times [2022-10-16 10:46:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:43,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752071937] [2022-10-16 10:46:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:46,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752071937] [2022-10-16 10:46:46,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752071937] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:46,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990617956] [2022-10-16 10:46:46,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:46,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:46,726 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:46,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 10:46:46,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:46:46,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:46,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 66 conjunts are in the unsatisfiable core [2022-10-16 10:46:46,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:46,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:46:46,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:46,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:46:46,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:46,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:46:47,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:46:47,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:46:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:47,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-10-16 10:46:48,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:48,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:46:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:48,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:48,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:48,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-10-16 10:46:49,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-10-16 10:46:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:46:49,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:49,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-10-16 10:46:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:50,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:50,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2022-10-16 10:46:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:50,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:35,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990617956] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:35,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:35,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 72 [2022-10-16 10:47:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797292518] [2022-10-16 10:47:35,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:35,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-16 10:47:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-16 10:47:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4766, Unknown=15, NotChecked=0, Total=5256 [2022-10-16 10:47:35,335 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 73 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 73 states have internal predecessors, (133), 0 states have call successors, (0), 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 10:48:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:35,702 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-10-16 10:48:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:48:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 73 states have internal predecessors, (133), 0 states have call successors, (0), 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 47 [2022-10-16 10:48:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:35,704 INFO L225 Difference]: With dead ends: 147 [2022-10-16 10:48:35,704 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:48:35,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=1163, Invalid=9311, Unknown=32, NotChecked=0, Total=10506 [2022-10-16 10:48:35,708 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 197 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 860 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:35,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 641 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 447 Invalid, 0 Unknown, 860 Unchecked, 0.5s Time] [2022-10-16 10:48:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:48:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2022-10-16 10:48:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 126 states have internal predecessors, (142), 0 states have call successors, (0), 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 10:48:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2022-10-16 10:48:35,727 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 47 [2022-10-16 10:48:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:35,727 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2022-10-16 10:48:35,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 73 states have internal predecessors, (133), 0 states have call successors, (0), 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 10:48:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2022-10-16 10:48:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:48:35,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:35,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:35,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-10-16 10:48:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 10:48:35,936 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 10:48:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 189048547, now seen corresponding path program 4 times [2022-10-16 10:48:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:35,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207707697] [2022-10-16 10:48:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:48:38,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:38,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207707697] [2022-10-16 10:48:38,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207707697] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:38,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168298089] [2022-10-16 10:48:38,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:48:38,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:38,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:38,226 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:38,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 10:48:38,335 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:48:38,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 10:48:38,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:38,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 10:48:38,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:48:38,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:38,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:38,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:38,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:38,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:48:39,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 10:48:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:48:39,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:48:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:39,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:48:40,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:40,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-10-16 10:48:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:40,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:40,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2022-10-16 10:48:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:41,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-10-16 10:48:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:48:41,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:42,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (< (+ v_ArrVal_1131 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) is different from false [2022-10-16 10:48:43,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1124)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131) (not (<= v_ArrVal_1124 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808))))) is different from false [2022-10-16 10:48:43,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1124)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ v_ArrVal_1128 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1131) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808) (not (<= v_ArrVal_1124 1)))))) is different from false [2022-10-16 10:48:43,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1124)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808) (not (<= v_ArrVal_1124 1)))))) is different from false [2022-10-16 10:48:43,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1124))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (not (<= v_ArrVal_1124 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808) (< (+ v_ArrVal_1128 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1131))))) is different from false [2022-10-16 10:48:43,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_#t~post7#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1124))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1131 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (not (<= v_ArrVal_1124 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131))))) is different from false [2022-10-16 10:48:43,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1124))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1124 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131))))) is different from false [2022-10-16 10:48:43,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1124 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1124))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1127))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1131) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1128) v_ArrVal_1131) (not (<= v_ArrVal_1124 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128))))) is different from false [2022-10-16 10:48:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 24 not checked. [2022-10-16 10:48:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168298089] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:43,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:43,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 59 [2022-10-16 10:48:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862449718] [2022-10-16 10:48:43,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:43,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-16 10:48:43,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-16 10:48:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2456, Unknown=8, NotChecked=856, Total=3540 [2022-10-16 10:48:43,694 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 states have internal predecessors, (121), 0 states have call successors, (0), 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 10:48:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:48,691 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-10-16 10:48:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:48:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 states have internal predecessors, (121), 0 states have call successors, (0), 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 47 [2022-10-16 10:48:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:48,692 INFO L225 Difference]: With dead ends: 132 [2022-10-16 10:48:48,692 INFO L226 Difference]: Without dead ends: 131 [2022-10-16 10:48:48,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=481, Invalid=5093, Unknown=8, NotChecked=1224, Total=6806 [2022-10-16 10:48:48,696 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:48,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 823 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1059 Invalid, 0 Unknown, 771 Unchecked, 1.1s Time] [2022-10-16 10:48:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-10-16 10:48:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-10-16 10:48:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.184873949579832) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 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 10:48:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-10-16 10:48:48,721 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 47 [2022-10-16 10:48:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:48,721 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-10-16 10:48:48,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 states have internal predecessors, (121), 0 states have call successors, (0), 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 10:48:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-10-16 10:48:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 10:48:48,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:48,722 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 10:48:48,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:48,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:48,936 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 10:48:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -554413087, now seen corresponding path program 1 times [2022-10-16 10:48:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:48,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886597039] [2022-10-16 10:48:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat