/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-patterns/array7_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 11:22:56,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 11:22:56,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 11:22:56,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 11:22:56,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 11:22:57,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 11:22:57,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 11:22:57,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 11:22:57,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 11:22:57,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 11:22:57,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 11:22:57,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 11:22:57,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 11:22:57,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 11:22:57,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 11:22:57,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 11:22:57,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 11:22:57,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 11:22:57,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 11:22:57,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 11:22:57,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 11:22:57,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 11:22:57,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 11:22:57,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 11:22:57,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 11:22:57,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 11:22:57,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 11:22:57,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 11:22:57,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 11:22:57,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 11:22:57,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 11:22:57,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 11:22:57,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 11:22:57,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 11:22:57,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 11:22:57,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 11:22:57,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 11:22:57,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 11:22:57,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 11:22:57,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 11:22:57,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 11:22:57,060 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 11:22:57,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 11:22:57,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 11:22:57,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 11:22:57,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 11:22:57,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 11:22:57,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 11:22:57,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 11:22:57,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 11:22:57,100 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 11:22:57,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 11:22:57,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 11:22:57,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 11:22:57,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 11:22:57,102 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 11:22:57,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 11:22:57,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 11:22:57,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 11:22:57,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 11:22:57,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 11:22:57,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 11:22:57,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 11:22:57,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:22:57,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 11:22:57,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 11:22:57,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 11:22:57,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 11:22:57,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 11:22:57,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 11:22:57,106 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 11:22:57,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 11:22:57,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 11:22:57,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 11:22:57,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 11:22:57,521 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 11:22:57,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array7_pattern.c [2022-10-16 11:22:57,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb5246e3/8dcfe2131d9448e3b5e5bfbfdb0ee042/FLAG194d93c53 [2022-10-16 11:22:58,169 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 11:22:58,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c [2022-10-16 11:22:58,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb5246e3/8dcfe2131d9448e3b5e5bfbfdb0ee042/FLAG194d93c53 [2022-10-16 11:22:58,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb5246e3/8dcfe2131d9448e3b5e5bfbfdb0ee042 [2022-10-16 11:22:58,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 11:22:58,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 11:22:58,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 11:22:58,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 11:22:58,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 11:22:58,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58, skipping insertion in model container [2022-10-16 11:22:58,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 11:22:58,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 11:22:58,713 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-patterns/array7_pattern.c[1375,1388] [2022-10-16 11:22:58,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:22:58,746 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 11:22:58,759 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-patterns/array7_pattern.c[1375,1388] [2022-10-16 11:22:58,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:22:58,787 INFO L208 MainTranslator]: Completed translation [2022-10-16 11:22:58,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58 WrapperNode [2022-10-16 11:22:58,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 11:22:58,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 11:22:58,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 11:22:58,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 11:22:58,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,834 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2022-10-16 11:22:58,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 11:22:58,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 11:22:58,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 11:22:58,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 11:22:58,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,864 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 11:22:58,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 11:22:58,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 11:22:58,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 11:22:58,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (1/1) ... [2022-10-16 11:22:58,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:22:58,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:58,911 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 11:22:58,934 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 11:22:58,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 11:22:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 11:22:58,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 11:22:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 11:22:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 11:22:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 11:22:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 11:22:58,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 11:22:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 11:22:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 11:22:59,060 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 11:22:59,063 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 11:22:59,629 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 11:22:59,652 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 11:22:59,656 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 11:22:59,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:22:59 BoogieIcfgContainer [2022-10-16 11:22:59,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 11:22:59,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 11:22:59,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 11:22:59,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 11:22:59,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:22:58" (1/3) ... [2022-10-16 11:22:59,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f50d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:22:59, skipping insertion in model container [2022-10-16 11:22:59,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:58" (2/3) ... [2022-10-16 11:22:59,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f50d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:22:59, skipping insertion in model container [2022-10-16 11:22:59,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:22:59" (3/3) ... [2022-10-16 11:22:59,677 INFO L112 eAbstractionObserver]: Analyzing ICFG array7_pattern.c [2022-10-16 11:22:59,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 11:22:59,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-10-16 11:22:59,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 11:22:59,832 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31455b45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 11:22:59,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-10-16 11:22:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 50 states have (on average 1.76) internal successors, (88), 78 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 11:22:59,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:59,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:59,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1462251300, now seen corresponding path program 1 times [2022-10-16 11:22:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:59,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481965554] [2022-10-16 11:22:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:00,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:00,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481965554] [2022-10-16 11:23:00,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-10-16 11:23:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135439439] [2022-10-16 11:23:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:00,101 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 11:23:00,103 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 11:23:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:00,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjunts are in the unsatisfiable core [2022-10-16 11:23:00,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:00,242 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 11:23:00,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:00,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135439439] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:00,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:00,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014523545] [2022-10-16 11:23:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:00,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 11:23:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:00,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 11:23:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 11:23:00,287 INFO L87 Difference]: Start difference. First operand has 83 states, 50 states have (on average 1.76) internal successors, (88), 78 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:00,318 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-10-16 11:23:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 11:23:00,321 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-16 11:23:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:00,329 INFO L225 Difference]: With dead ends: 163 [2022-10-16 11:23:00,330 INFO L226 Difference]: Without dead ends: 76 [2022-10-16 11:23:00,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 11:23:00,338 INFO L413 NwaCegarLoop]: 88 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, 88 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 11:23:00,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-16 11:23:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-10-16 11:23:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-10-16 11:23:00,387 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 10 [2022-10-16 11:23:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:00,388 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-10-16 11:23:00,388 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-10-16 11:23:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 11:23:00,390 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:00,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:00,430 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 11:23:00,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-10-16 11:23:00,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1404992998, now seen corresponding path program 1 times [2022-10-16 11:23:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544596485] [2022-10-16 11:23:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:00,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611135102] [2022-10-16 11:23:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:00,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:00,653 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 11:23:00,672 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 11:23:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:00,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:23:00,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:00,782 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 11:23:00,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:00,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544596485] [2022-10-16 11:23:00,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:00,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611135102] [2022-10-16 11:23:00,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611135102] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:00,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:00,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495937575] [2022-10-16 11:23:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:00,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:00,793 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:00,896 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-10-16 11:23:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-16 11:23:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:00,899 INFO L225 Difference]: With dead ends: 144 [2022-10-16 11:23:00,899 INFO L226 Difference]: Without dead ends: 141 [2022-10-16 11:23:00,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:00,901 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:00,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 135 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-16 11:23:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2022-10-16 11:23:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.68) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-10-16 11:23:00,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 10 [2022-10-16 11:23:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:00,918 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-10-16 11:23:00,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-10-16 11:23:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 11:23:00,919 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:00,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:00,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-16 11:23:01,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-10-16 11:23:01,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -605109932, now seen corresponding path program 1 times [2022-10-16 11:23:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:01,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532381666] [2022-10-16 11:23:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:01,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:01,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305642907] [2022-10-16 11:23:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:01,162 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 11:23:01,180 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 11:23:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:23:01,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:01,255 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 11:23:01,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532381666] [2022-10-16 11:23:01,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305642907] [2022-10-16 11:23:01,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305642907] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:01,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:01,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466729731] [2022-10-16 11:23:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:01,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:01,260 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:01,348 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2022-10-16 11:23:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-10-16 11:23:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:01,351 INFO L225 Difference]: With dead ends: 141 [2022-10-16 11:23:01,351 INFO L226 Difference]: Without dead ends: 138 [2022-10-16 11:23:01,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:01,353 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-10-16 11:23:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2022-10-16 11:23:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-10-16 11:23:01,366 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 11 [2022-10-16 11:23:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:01,367 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-10-16 11:23:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-10-16 11:23:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 11:23:01,368 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:01,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:01,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 11:23:01,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:01,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1206659982, now seen corresponding path program 1 times [2022-10-16 11:23:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:01,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709884243] [2022-10-16 11:23:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:23:01,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:01,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709884243] [2022-10-16 11:23:01,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709884243] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:01,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:01,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:23:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257579283] [2022-10-16 11:23:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:01,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:23:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:23:01,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:23:01,832 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:01,986 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-10-16 11:23:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 11:23:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-10-16 11:23:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:01,988 INFO L225 Difference]: With dead ends: 158 [2022-10-16 11:23:01,988 INFO L226 Difference]: Without dead ends: 141 [2022-10-16 11:23:01,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:23:01,990 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:01,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 220 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-16 11:23:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2022-10-16 11:23:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.63013698630137) internal successors, (119), 100 states have internal predecessors, (119), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2022-10-16 11:23:02,004 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 18 [2022-10-16 11:23:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:02,005 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2022-10-16 11:23:02,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-10-16 11:23:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 11:23:02,007 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:02,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:02,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 11:23:02,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -194569126, now seen corresponding path program 1 times [2022-10-16 11:23:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:02,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429364470] [2022-10-16 11:23:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:02,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:02,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427240193] [2022-10-16 11:23:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:02,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:02,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:02,026 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 11:23:02,052 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 11:23:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:02,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 11:23:02,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:02,156 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 11:23:02,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:02,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429364470] [2022-10-16 11:23:02,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:02,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427240193] [2022-10-16 11:23:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427240193] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:02,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:02,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:23:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183066291] [2022-10-16 11:23:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:02,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:23:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:23:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:23:02,160 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:02,225 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-10-16 11:23:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:23:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-10-16 11:23:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:02,227 INFO L225 Difference]: With dead ends: 140 [2022-10-16 11:23:02,227 INFO L226 Difference]: Without dead ends: 139 [2022-10-16 11:23:02,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 11:23:02,229 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 52 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:02,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 192 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-10-16 11:23:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2022-10-16 11:23:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 102 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2022-10-16 11:23:02,242 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 17 [2022-10-16 11:23:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:02,242 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2022-10-16 11:23:02,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-10-16 11:23:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 11:23:02,244 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:02,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:02,283 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 11:23:02,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:02,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1248246302, now seen corresponding path program 1 times [2022-10-16 11:23:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:02,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477743977] [2022-10-16 11:23:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:23:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477743977] [2022-10-16 11:23:02,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477743977] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:02,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:02,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:23:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127003885] [2022-10-16 11:23:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:02,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:23:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:23:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:23:02,572 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:02,633 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-10-16 11:23:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:23:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-10-16 11:23:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:02,635 INFO L225 Difference]: With dead ends: 112 [2022-10-16 11:23:02,635 INFO L226 Difference]: Without dead ends: 111 [2022-10-16 11:23:02,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 11:23:02,637 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 118 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:02,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-16 11:23:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-10-16 11:23:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.5866666666666667) internal successors, (119), 101 states have internal predecessors, (119), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2022-10-16 11:23:02,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 19 [2022-10-16 11:23:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:02,651 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2022-10-16 11:23:02,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2022-10-16 11:23:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 11:23:02,652 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:02,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 11:23:02,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1736675550, now seen corresponding path program 1 times [2022-10-16 11:23:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:02,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848684327] [2022-10-16 11:23:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:02,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14471074] [2022-10-16 11:23:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:02,669 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 11:23:02,679 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 11:23:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:02,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 11:23:02,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:02,755 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 11:23:02,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848684327] [2022-10-16 11:23:02,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14471074] [2022-10-16 11:23:02,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14471074] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:02,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:02,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:23:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544559018] [2022-10-16 11:23:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:02,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:23:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:23:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:23:02,760 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:02,809 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-10-16 11:23:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:23:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 11:23:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:02,811 INFO L225 Difference]: With dead ends: 123 [2022-10-16 11:23:02,811 INFO L226 Difference]: Without dead ends: 121 [2022-10-16 11:23:02,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 11:23:02,813 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:02,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-10-16 11:23:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2022-10-16 11:23:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.56) internal successors, (117), 99 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2022-10-16 11:23:02,824 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 18 [2022-10-16 11:23:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:02,825 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2022-10-16 11:23:02,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2022-10-16 11:23:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 11:23:02,826 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:02,826 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:02,865 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 11:23:03,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:03,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1797075940, now seen corresponding path program 1 times [2022-10-16 11:23:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:03,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359666918] [2022-10-16 11:23:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:03,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:03,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124747921] [2022-10-16 11:23:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:03,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:03,059 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 11:23:03,074 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 11:23:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:03,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 11:23:03,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:03,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359666918] [2022-10-16 11:23:03,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124747921] [2022-10-16 11:23:03,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124747921] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:03,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:03,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:23:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445176028] [2022-10-16 11:23:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:03,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:23:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:03,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:23:03,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:23:03,195 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:03,297 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-10-16 11:23:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:23:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-10-16 11:23:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:03,298 INFO L225 Difference]: With dead ends: 134 [2022-10-16 11:23:03,299 INFO L226 Difference]: Without dead ends: 132 [2022-10-16 11:23:03,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:23:03,300 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:03,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 244 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-10-16 11:23:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2022-10-16 11:23:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 97 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-10-16 11:23:03,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 20 [2022-10-16 11:23:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:03,309 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-10-16 11:23:03,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-10-16 11:23:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 11:23:03,310 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:03,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:03,336 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 11:23:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:03,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -125220662, now seen corresponding path program 1 times [2022-10-16 11:23:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:03,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728252104] [2022-10-16 11:23:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:03,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791151055] [2022-10-16 11:23:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:03,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:03,543 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 11:23:03,565 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 11:23:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:03,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:23:03,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:03,695 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 11:23:03,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:03,913 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 11:23:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728252104] [2022-10-16 11:23:03,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791151055] [2022-10-16 11:23:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791151055] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:03,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:03,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-10-16 11:23:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317214272] [2022-10-16 11:23:03,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:03,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 11:23:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:03,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 11:23:03,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:23:03,917 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:04,012 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-10-16 11:23:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:23:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-10-16 11:23:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:04,016 INFO L225 Difference]: With dead ends: 133 [2022-10-16 11:23:04,016 INFO L226 Difference]: Without dead ends: 130 [2022-10-16 11:23:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:23:04,017 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 288 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:04,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 166 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-10-16 11:23:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-10-16 11:23:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2022-10-16 11:23:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 94 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-10-16 11:23:04,027 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 21 [2022-10-16 11:23:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:04,028 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-10-16 11:23:04,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-10-16 11:23:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 11:23:04,029 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:04,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:04,069 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 11:23:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:04,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1482022124, now seen corresponding path program 1 times [2022-10-16 11:23:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:04,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482359858] [2022-10-16 11:23:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 11:23:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:04,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482359858] [2022-10-16 11:23:04,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482359858] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:04,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:04,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:23:04,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421595753] [2022-10-16 11:23:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:04,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:23:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:23:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:23:04,377 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:04,445 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2022-10-16 11:23:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:23:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-10-16 11:23:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:04,452 INFO L225 Difference]: With dead ends: 159 [2022-10-16 11:23:04,452 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 11:23:04,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 11:23:04,453 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 79 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:04,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 137 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 11:23:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2022-10-16 11:23:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 110 states have internal predecessors, (138), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:23:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-10-16 11:23:04,466 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 24 [2022-10-16 11:23:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:04,466 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-10-16 11:23:04,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-10-16 11:23:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 11:23:04,468 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:04,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:04,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 11:23:04,468 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1301954501, now seen corresponding path program 1 times [2022-10-16 11:23:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:04,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697493296] [2022-10-16 11:23:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 11:23:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:04,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697493296] [2022-10-16 11:23:04,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697493296] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:04,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:04,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964909153] [2022-10-16 11:23:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:04,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:04,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,570 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:04,611 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2022-10-16 11:23:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-10-16 11:23:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:04,613 INFO L225 Difference]: With dead ends: 122 [2022-10-16 11:23:04,614 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 11:23:04,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,615 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:04,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 71 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 11:23:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-10-16 11:23:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 108 states have internal predecessors, (132), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:23:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2022-10-16 11:23:04,628 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 25 [2022-10-16 11:23:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:04,629 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2022-10-16 11:23:04,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2022-10-16 11:23:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 11:23:04,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:04,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:04,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 11:23:04,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1705883958, now seen corresponding path program 1 times [2022-10-16 11:23:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:04,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606832977] [2022-10-16 11:23:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 11:23:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:04,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606832977] [2022-10-16 11:23:04,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606832977] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:04,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:04,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829514693] [2022-10-16 11:23:04,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:04,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,768 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:04,806 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-10-16 11:23:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-10-16 11:23:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:04,810 INFO L225 Difference]: With dead ends: 120 [2022-10-16 11:23:04,810 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 11:23:04,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,812 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:04,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 71 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 11:23:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-10-16 11:23:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 106 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:23:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2022-10-16 11:23:04,825 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 26 [2022-10-16 11:23:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:04,825 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2022-10-16 11:23:04,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2022-10-16 11:23:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 11:23:04,826 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:04,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:04,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 11:23:04,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash 519386328, now seen corresponding path program 1 times [2022-10-16 11:23:04,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:04,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513252848] [2022-10-16 11:23:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:04,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 11:23:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:04,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513252848] [2022-10-16 11:23:04,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513252848] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:04,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491668813] [2022-10-16 11:23:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:04,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:04,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:04,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,891 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:04,925 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-10-16 11:23:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:04,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-10-16 11:23:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:04,927 INFO L225 Difference]: With dead ends: 118 [2022-10-16 11:23:04,927 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 11:23:04,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:04,929 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:04,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 71 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 11:23:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2022-10-16 11:23:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 88 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2022-10-16 11:23:04,938 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 26 [2022-10-16 11:23:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:04,939 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2022-10-16 11:23:04,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2022-10-16 11:23:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 11:23:04,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:04,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:04,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 11:23:04,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1342795239, now seen corresponding path program 1 times [2022-10-16 11:23:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:04,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133533206] [2022-10-16 11:23:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 11:23:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:05,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133533206] [2022-10-16 11:23:05,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133533206] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:05,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:05,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:23:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301035111] [2022-10-16 11:23:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:23:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:23:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:23:05,033 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:05,151 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-10-16 11:23:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:23:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-10-16 11:23:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:05,153 INFO L225 Difference]: With dead ends: 151 [2022-10-16 11:23:05,153 INFO L226 Difference]: Without dead ends: 149 [2022-10-16 11:23:05,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:23:05,154 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:05,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 121 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-16 11:23:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2022-10-16 11:23:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 110 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:23:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2022-10-16 11:23:05,168 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 27 [2022-10-16 11:23:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:05,168 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2022-10-16 11:23:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2022-10-16 11:23:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 11:23:05,169 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:05,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:05,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 11:23:05,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1323020456, now seen corresponding path program 1 times [2022-10-16 11:23:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329271022] [2022-10-16 11:23:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 11:23:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:23:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329271022] [2022-10-16 11:23:05,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329271022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:05,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:05,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 11:23:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566749638] [2022-10-16 11:23:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:05,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:23:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:23:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:23:05,294 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:05,328 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2022-10-16 11:23:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:23:05,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-10-16 11:23:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:05,330 INFO L225 Difference]: With dead ends: 194 [2022-10-16 11:23:05,330 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 11:23:05,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 11:23:05,331 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:05,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 235 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 11:23:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-16 11:23:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 88 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-10-16 11:23:05,342 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 28 [2022-10-16 11:23:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:05,342 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-10-16 11:23:05,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-10-16 11:23:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 11:23:05,343 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:05,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:05,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 11:23:05,344 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:05,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1728981597, now seen corresponding path program 1 times [2022-10-16 11:23:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:05,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251081794] [2022-10-16 11:23:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 11:23:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:23:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:05,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251081794] [2022-10-16 11:23:05,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251081794] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:05,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:05,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:23:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82380363] [2022-10-16 11:23:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:05,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:23:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:23:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:05,422 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:05,455 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-10-16 11:23:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:23:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-10-16 11:23:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:05,456 INFO L225 Difference]: With dead ends: 98 [2022-10-16 11:23:05,456 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 11:23:05,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:23:05,457 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 70 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 11:23:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-10-16 11:23:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 86 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-10-16 11:23:05,468 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 29 [2022-10-16 11:23:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-10-16 11:23:05,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-10-16 11:23:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 11:23:05,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:05,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 11:23:05,471 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1162994628, now seen corresponding path program 1 times [2022-10-16 11:23:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:05,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489881190] [2022-10-16 11:23:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:05,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969376557] [2022-10-16 11:23:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:05,490 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 11:23:05,507 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 11:23:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:23:05,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 11:23:05,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489881190] [2022-10-16 11:23:05,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969376557] [2022-10-16 11:23:05,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969376557] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:05,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:23:05,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:23:05,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823326918] [2022-10-16 11:23:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:05,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:23:05,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:05,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:23:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:23:05,615 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:05,657 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-10-16 11:23:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:23:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-10-16 11:23:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:05,659 INFO L225 Difference]: With dead ends: 96 [2022-10-16 11:23:05,659 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 11:23:05,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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 11:23:05,661 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:05,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:23:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 11:23:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-10-16 11:23:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.24) internal successors, (93), 85 states have internal predecessors, (93), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-10-16 11:23:05,672 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 28 [2022-10-16 11:23:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:05,673 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-10-16 11:23:05,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-10-16 11:23:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 11:23:05,674 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:05,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:05,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 11:23:05,888 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,SelfDestructingSolverStorable16 [2022-10-16 11:23:05,889 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2132823216, now seen corresponding path program 1 times [2022-10-16 11:23:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:05,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748178599] [2022-10-16 11:23:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:05,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:05,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177890898] [2022-10-16 11:23:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:05,903 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 11:23:05,918 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 11:23:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:05,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:23:05,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:06,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:06,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748178599] [2022-10-16 11:23:06,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:06,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177890898] [2022-10-16 11:23:06,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177890898] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:06,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:06,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-10-16 11:23:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789255] [2022-10-16 11:23:06,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:06,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 11:23:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 11:23:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:23:06,071 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:06,210 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2022-10-16 11:23:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 11:23:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-10-16 11:23:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:06,213 INFO L225 Difference]: With dead ends: 221 [2022-10-16 11:23:06,213 INFO L226 Difference]: Without dead ends: 220 [2022-10-16 11:23:06,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-10-16 11:23:06,214 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 130 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:06,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 356 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-16 11:23:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 123. [2022-10-16 11:23:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.2) internal successors, (126), 115 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2022-10-16 11:23:06,226 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 27 [2022-10-16 11:23:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:06,227 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2022-10-16 11:23:06,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:23:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-10-16 11:23:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 11:23:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:06,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:06,266 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 11:23:06,441 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,SelfDestructingSolverStorable17 [2022-10-16 11:23:06,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2058821860, now seen corresponding path program 1 times [2022-10-16 11:23:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:06,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057333678] [2022-10-16 11:23:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:23:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 11:23:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 11:23:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:23:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:06,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057333678] [2022-10-16 11:23:06,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057333678] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:23:06,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488198855] [2022-10-16 11:23:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:06,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:06,574 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 11:23:06,577 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 11:23:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:06,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 11:23:06,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:23:06,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:23:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488198855] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:23:06,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:23:06,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-10-16 11:23:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568878156] [2022-10-16 11:23:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:23:06,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:23:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:23:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:23:06,657 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:06,743 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2022-10-16 11:23:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 11:23:06,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-10-16 11:23:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:06,745 INFO L225 Difference]: With dead ends: 145 [2022-10-16 11:23:06,745 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 11:23:06,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:23:06,746 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 82 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:06,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 166 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 11:23:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2022-10-16 11:23:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.186046511627907) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-10-16 11:23:06,755 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 30 [2022-10-16 11:23:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:06,756 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-10-16 11:23:06,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:23:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-10-16 11:23:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 11:23:06,757 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:06,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:06,787 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 11:23:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:06,971 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash -82589722, now seen corresponding path program 1 times [2022-10-16 11:23:06,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:06,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580885307] [2022-10-16 11:23:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:06,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171456734] [2022-10-16 11:23:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:06,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:06,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:06,985 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 11:23:07,003 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 11:23:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-16 11:23:07,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:23:07,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 11:23:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:07,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580885307] [2022-10-16 11:23:07,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:07,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171456734] [2022-10-16 11:23:07,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171456734] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:07,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:07,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-10-16 11:23:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271394543] [2022-10-16 11:23:07,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 11:23:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 11:23:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-10-16 11:23:07,491 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 11:23:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:08,034 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2022-10-16 11:23:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 11:23:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2022-10-16 11:23:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:08,036 INFO L225 Difference]: With dead ends: 182 [2022-10-16 11:23:08,036 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 11:23:08,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2022-10-16 11:23:08,038 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 104 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:08,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 469 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 11:23:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 11:23:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2022-10-16 11:23:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-10-16 11:23:08,065 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 40 [2022-10-16 11:23:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:08,065 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-10-16 11:23:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 11:23:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-10-16 11:23:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 11:23:08,066 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:08,067 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:08,096 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 11:23:08,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:08,283 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 782537522, now seen corresponding path program 2 times [2022-10-16 11:23:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:08,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023043633] [2022-10-16 11:23:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:08,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:08,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719985916] [2022-10-16 11:23:08,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:23:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:08,312 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 11:23:08,334 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 11:23:08,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 11:23:08,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:23:08,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:23:08,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 11:23:08,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 11:23:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:08,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023043633] [2022-10-16 11:23:08,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719985916] [2022-10-16 11:23:08,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719985916] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:08,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:08,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-10-16 11:23:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133253163] [2022-10-16 11:23:08,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:08,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 11:23:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:08,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 11:23:08,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:23:08,567 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:08,652 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-10-16 11:23:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:23:08,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-10-16 11:23:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:08,654 INFO L225 Difference]: With dead ends: 103 [2022-10-16 11:23:08,654 INFO L226 Difference]: Without dead ends: 102 [2022-10-16 11:23:08,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-10-16 11:23:08,655 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 87 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:08,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 165 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-16 11:23:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-10-16 11:23:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 77 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-10-16 11:23:08,666 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 57 [2022-10-16 11:23:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:08,666 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-10-16 11:23:08,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-10-16 11:23:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 11:23:08,667 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:08,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:08,703 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 11:23:08,881 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,SelfDestructingSolverStorable20 [2022-10-16 11:23:08,881 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 919231482, now seen corresponding path program 2 times [2022-10-16 11:23:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020200635] [2022-10-16 11:23:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:08,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:08,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916683793] [2022-10-16 11:23:08,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:23:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:08,901 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 11:23:08,923 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 11:23:09,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:23:09,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:23:09,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 11:23:09,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:09,068 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 11:23:09,118 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 11:23:09,156 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 23 [2022-10-16 11:23:09,281 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 35 treesize of output 34 [2022-10-16 11:23:09,312 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 26 treesize of output 28 [2022-10-16 11:23:09,427 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:23:09,428 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 23 treesize of output 22 [2022-10-16 11:23:09,474 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 25 treesize of output 25 [2022-10-16 11:23:10,571 INFO L356 Elim1Store]: treesize reduction 76, result has 8.4 percent of original size [2022-10-16 11:23:10,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 40 [2022-10-16 11:23:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:10,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:24,154 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 63 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:23:30,685 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:23:41,018 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:23:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:41,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020200635] [2022-10-16 11:23:41,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:41,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916683793] [2022-10-16 11:23:41,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916683793] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:23:41,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:23:41,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-10-16 11:23:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286255629] [2022-10-16 11:23:41,023 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:41,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 11:23:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 11:23:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1244, Unknown=1, NotChecked=0, Total=1406 [2022-10-16 11:23:41,025 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 27 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:42,634 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-10-16 11:23:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 11:23:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-10-16 11:23:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:42,640 INFO L225 Difference]: With dead ends: 129 [2022-10-16 11:23:42,640 INFO L226 Difference]: Without dead ends: 128 [2022-10-16 11:23:42,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=243, Invalid=1918, Unknown=1, NotChecked=0, Total=2162 [2022-10-16 11:23:42,642 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 66 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:42,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 569 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 810 Invalid, 0 Unknown, 253 Unchecked, 0.9s Time] [2022-10-16 11:23:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-10-16 11:23:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2022-10-16 11:23:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 104 states have internal predecessors, (108), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:23:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-10-16 11:23:42,659 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 60 [2022-10-16 11:23:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:42,660 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-10-16 11:23:42,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-10-16 11:23:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 11:23:42,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:42,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:42,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-10-16 11:23:42,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 11:23:42,875 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1568595033, now seen corresponding path program 1 times [2022-10-16 11:23:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361623826] [2022-10-16 11:23:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:42,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:42,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68407735] [2022-10-16 11:23:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:42,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:42,907 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 11:23:42,911 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 11:23:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:43,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 55 conjunts are in the unsatisfiable core [2022-10-16 11:23:43,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:43,057 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 11:23:43,099 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 11:23:43,131 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 23 [2022-10-16 11:23:43,264 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 35 treesize of output 34 [2022-10-16 11:23:43,294 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 26 treesize of output 28 [2022-10-16 11:23:43,407 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:23:43,408 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 23 treesize of output 22 [2022-10-16 11:23:43,456 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 25 treesize of output 25 [2022-10-16 11:23:44,765 INFO L356 Elim1Store]: treesize reduction 76, result has 8.4 percent of original size [2022-10-16 11:23:44,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 40 [2022-10-16 11:23:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:44,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:54,424 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 64 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:24:10,970 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:24:26,436 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:24:31,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse6 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse3 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse2) .cse1) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse2) .cse3) (< .cse3 .cse2) (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6 32768) .cse0))))) is different from false [2022-10-16 11:24:37,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse6 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse4 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse0 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse2 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (< (+ |c_ULTIMATE.start_main_#t~post5#1| .cse0 1) .cse1) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse2 32767) .cse1) (< 0 (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post5#1| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_356)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (not (<= (+ (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_356)) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse0) .cse4) (< .cse4 .cse0) (< (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6 32768) .cse2))))) is different from false [2022-10-16 11:24:37,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse6 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse3 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse2) .cse3) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse2 1) .cse1) (< 0 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4) 4) v_ArrVal_356)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (< .cse3 .cse2) (< (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6 32768) .cse0))))) is different from false [2022-10-16 11:24:38,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse6 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse7 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7)) (.cse5 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7)) (.cse4 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< 0 (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4) 4) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (< (+ 2147483647 .cse4) .cse5) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse4 1) .cse1) (< .cse5 .cse4) (< (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7 32768) .cse0))))) is different from false [2022-10-16 11:24:41,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse8 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse3 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse2) .cse3) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse2 1) .cse1) (< 0 (let ((.cse4 (select (store (let ((.cse6 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse5 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6 4) v_ArrVal_356)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< .cse3 .cse2) (< (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8 32768) .cse0))))) is different from false [2022-10-16 11:24:42,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse8 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse6 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< (+ 2 |c_ULTIMATE.start_main_#t~post5#1| .cse2) .cse1) (not (<= (+ (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 0 (let ((.cse3 (select (store (let ((.cse5 (* |c_ULTIMATE.start_main_#t~post5#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 8) v_ArrVal_356)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) 2147483649 (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse2) .cse6) (< .cse6 .cse2) (< (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8 32768) .cse0))))) is different from false [2022-10-16 11:24:42,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse8 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse6 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| 2 .cse2) .cse1) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< 0 (let ((.cse3 (select (store (let ((.cse5 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 4) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse5 8) v_ArrVal_356)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) 2147483649 (select .cse3 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< (+ 2147483647 .cse2) .cse6) (< .cse6 .cse2) (< (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse8 32768) .cse0))))) is different from false [2022-10-16 11:24:43,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse9 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse5 (+ .cse8 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse9)) (.cse7 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse9)) (.cse6 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse4 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (< 0 (let ((.cse0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (let ((.cse1 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_352))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 4) v_ArrVal_353))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse1 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 8) v_ArrVal_356)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse4 32767) .cse5) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| 2 .cse6) .cse5) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse6) .cse7) (< .cse7 .cse6) (< (+ .cse8 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse9 32768) .cse4))))) is different from false [2022-10-16 11:24:44,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:44,925 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 246 treesize of output 163 [2022-10-16 11:24:44,954 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 393 treesize of output 387 [2022-10-16 11:24:45,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 298 treesize of output 254 [2022-10-16 11:24:45,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 442 treesize of output 362 [2022-10-16 11:24:45,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:45,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 426 treesize of output 370 [2022-10-16 11:24:45,672 INFO L356 Elim1Store]: treesize reduction 20, result has 62.3 percent of original size [2022-10-16 11:24:45,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 774 treesize of output 720 [2022-10-16 11:24:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 7 refuted. 3 times theorem prover too weak. 3 trivial. 26 not checked. [2022-10-16 11:24:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:24:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361623826] [2022-10-16 11:24:49,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:24:49,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68407735] [2022-10-16 11:24:49,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68407735] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:24:49,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:24:49,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2022-10-16 11:24:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839808671] [2022-10-16 11:24:49,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:24:49,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-16 11:24:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:24:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-16 11:24:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1770, Unknown=17, NotChecked=744, Total=2756 [2022-10-16 11:24:49,266 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 53 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:25:20,006 WARN L233 SmtUtils]: Spent 24.44s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:25:46,606 WARN L233 SmtUtils]: Spent 20.34s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:25:48,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (and (forall ((v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse5 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse6 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse3 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6)) (.cse2 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse2) .cse1) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse2) .cse3) (< .cse3 .cse2) (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse6 32768) .cse0))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8))) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse17 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse13 (+ .cse16 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse17)) (.cse15 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse17)) (.cse14 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse12 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (not (<= (+ .cse7 (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (< 0 (let ((.cse9 (select (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_352))) (store .cse11 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8 4) v_ArrVal_353))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse10 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8 8) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse12 32767) .cse13) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| 2 .cse14) .cse13) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse14) .cse15) (< .cse15 .cse14) (< (+ .cse16 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse17 32768) .cse12))))))) is different from false [2022-10-16 11:25:50,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2))) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse10 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse4 (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse8 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse5 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse3 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (not (<= (+ .cse0 (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse3 32767) .cse4) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< (+ |c_ULTIMATE.start_main_~count~0#1| 2 .cse5) .cse4) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< 0 (let ((.cse6 (select (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 4) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 8) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) 2147483649 (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< (+ 2147483647 .cse5) .cse8) (< .cse8 .cse5) (< (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10 32768) .cse3))))))) is different from false [2022-10-16 11:25:52,813 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_#t~post5#1| 4))) (and (<= .cse0 (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse10 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse4 (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse8 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse5 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse3 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse3 32767) .cse4) (< (+ 2 |c_ULTIMATE.start_main_#t~post5#1| .cse5) .cse4) (not (<= (+ .cse0 (* 2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) v_ArrVal_356)) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 0 (let ((.cse6 (select (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 8) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) 2147483649 (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse5) .cse8) (< .cse8 .cse5) (< (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10 32768) .cse3))))) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (= |c_ULTIMATE.start_main_#t~post5#1| 0))) is different from false [2022-10-16 11:25:54,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (* |c_ULTIMATE.start_main_~count~0#1| 4)) (.cse3 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 1) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_353 Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse11 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse1 (+ .cse10 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse11)) (.cse5 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse11)) (.cse4 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse0 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse0 32767) .cse1) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ .cse2 .cse3) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse4) .cse5) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse4 1) .cse1) (< 0 (let ((.cse6 (select (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) v_ArrVal_353)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8 4) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4))) (select .cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4)))))) (< .cse5 .cse4) (< (+ .cse10 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse11 32768) .cse0))))) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (<= .cse2 (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse8)) .cse3)))) is different from false [2022-10-16 11:25:56,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse2 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 1) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (<= .cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1)) .cse2)) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (v_ArrVal_355 (Array Int Int)) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse10 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse4 (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse8 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse7 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse3 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse3 32767) .cse4) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ .cse0 .cse2) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< 0 (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_355))) (store .cse6 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 4) v_ArrVal_356))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (< (+ 2147483647 .cse7) .cse8) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse7 1) .cse4) (< .cse8 .cse7) (< (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10 32768) .cse3))))))) is different from false [2022-10-16 11:25:58,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse3 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 1) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (<= .cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse2)) .cse3)) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse10 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse5 (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse7 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10)) (.cse6 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse4 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse4 32767) .cse5) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (not (<= (+ .cse0 .cse3) v_ArrVal_356)) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse6) .cse7) (< (+ |c_ULTIMATE.start_main_~count~0#1| .cse6 1) .cse5) (< 0 (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 4) v_ArrVal_356)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse8 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (< .cse7 .cse6) (< (+ .cse9 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse10 32768) .cse4))))))) is different from false [2022-10-16 11:26:00,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int)) (|aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| Int) (|aux_div_ULTIMATE.start_main_#t~nondet6#1_93| Int) (|v_ULTIMATE.start_main_~pivot~0#1_40| Int)) (let ((.cse6 (* |aux_div_ULTIMATE.start_main_#t~nondet6#1_93| 4294967296)) (.cse7 (* |aux_div_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296))) (let ((.cse2 (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7)) (.cse5 (+ |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7)) (.cse1 (* 4294967294 |v_ULTIMATE.start_main_~pivot~0#1_40|)) (.cse3 (* 4294967295 |v_ULTIMATE.start_main_~pivot~0#1_40|))) (or (< (+ |c_ULTIMATE.start_main_#t~post5#1| .cse1 1) .cse2) (<= |v_ULTIMATE.start_main_~pivot~0#1_40| 0) (< (+ .cse3 32767) .cse2) (< 0 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ (* |c_ULTIMATE.start_main_#t~post5#1| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_356)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ 2147483649 (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod (+ (* 2 |v_ULTIMATE.start_main_~pivot~0#1_40|) |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) 4294967296) 4))) (select .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 4294967296) 4)))))) (not (<= (+ (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_356)) (< |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| 0) (< 32767 |v_ULTIMATE.start_main_~pivot~0#1_40|) (< 2147483647 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119|) (< (+ 2147483647 .cse1) .cse5) (< .cse5 .cse1) (< (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_#t~nondet6#1_93_119| .cse7 32768) .cse3))))) (= |c_ULTIMATE.start_main_#t~post5#1| 1))) is different from false [2022-10-16 11:26:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:26:02,407 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-10-16 11:26:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-16 11:26:02,408 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 61 [2022-10-16 11:26:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:26:02,410 INFO L225 Difference]: With dead ends: 141 [2022-10-16 11:26:02,411 INFO L226 Difference]: Without dead ends: 140 [2022-10-16 11:26:02,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 120.4s TimeCoverageRelationStatistics Valid=309, Invalid=2271, Unknown=30, NotChecked=1680, Total=4290 [2022-10-16 11:26:02,414 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 785 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:26:02,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 578 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 386 Invalid, 0 Unknown, 785 Unchecked, 1.1s Time] [2022-10-16 11:26:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-10-16 11:26:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2022-10-16 11:26:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 105 states have internal predecessors, (109), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:26:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2022-10-16 11:26:02,427 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 61 [2022-10-16 11:26:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:26:02,427 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2022-10-16 11:26:02,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 48 states have (on average 2.1875) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:26:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-10-16 11:26:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 11:26:02,429 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:26:02,429 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:26:02,438 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 11:26:02,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:26:02,634 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:26:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:26:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1571250976, now seen corresponding path program 1 times [2022-10-16 11:26:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:26:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181407640] [2022-10-16 11:26:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:26:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:26:02,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:26:02,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628057905] [2022-10-16 11:26:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:26:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:26:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:26:02,651 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 11:26:02,658 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 11:26:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:26:02,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-16 11:26:02,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:26:02,830 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 11:26:02,885 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 11:26:03,015 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 14 treesize of output 16 [2022-10-16 11:26:03,049 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:26:03,050 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 23 treesize of output 22 [2022-10-16 11:26:03,169 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 14 treesize of output 16 [2022-10-16 11:26:03,208 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:26:03,208 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 23 treesize of output 22 [2022-10-16 11:26:04,403 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 25 treesize of output 25 [2022-10-16 11:26:04,752 INFO L356 Elim1Store]: treesize reduction 76, result has 8.4 percent of original size [2022-10-16 11:26:04,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 42 [2022-10-16 11:26:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:26:04,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:26:05,385 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |c_ULTIMATE.start_main_~index~0#1|) 4294967296))) (let ((.cse6 (<= .cse14 2147483647)) (.cse13 (* .cse14 4)) (.cse12 (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~pivot~0#1|) |c_ULTIMATE.start_main_~index~0#1|) 4294967296))) (let ((.cse8 (<= .cse12 2147483647)) (.cse2 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse0 (not .cse6)) (.cse5 (+ .cse13 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse7 (* .cse12 4))) (and (or (let ((.cse3 (+ (- 17179869184) .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_406 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse1 .cse2) (select .cse1 .cse3))) 2147483648))) (or (forall ((v_ArrVal_406 (Array Int Int))) (< (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse4 .cse5) (select .cse4 .cse3))) 2147483648)) .cse6))) .cse8) (or (not .cse8) (let ((.cse10 (+ .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (forall ((v_ArrVal_406 (Array Int Int))) (< (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse9 .cse10) (select .cse9 .cse2))) 2147483648)) .cse0) (or .cse6 (forall ((v_ArrVal_406 (Array Int Int))) (< (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse11 .cse10) (select .cse11 .cse5))) 2147483648)))))))))) is different from false [2022-10-16 11:26:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:26:06,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181407640] [2022-10-16 11:26:06,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:26:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628057905] [2022-10-16 11:26:06,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628057905] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:26:06,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:26:06,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-10-16 11:26:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649572176] [2022-10-16 11:26:06,108 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:26:06,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 11:26:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:26:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 11:26:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=773, Unknown=1, NotChecked=56, Total=930 [2022-10-16 11:26:06,113 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 26 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:26:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:26:07,662 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2022-10-16 11:26:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 11:26:07,663 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2022-10-16 11:26:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:26:07,665 INFO L225 Difference]: With dead ends: 163 [2022-10-16 11:26:07,665 INFO L226 Difference]: Without dead ends: 162 [2022-10-16 11:26:07,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-10-16 11:26:07,668 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 11:26:07,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 593 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 789 Invalid, 0 Unknown, 208 Unchecked, 0.9s Time] [2022-10-16 11:26:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-10-16 11:26:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2022-10-16 11:26:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 117 states have internal predecessors, (122), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 11:26:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2022-10-16 11:26:07,694 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 66 [2022-10-16 11:26:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:26:07,694 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2022-10-16 11:26:07,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:26:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-10-16 11:26:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 11:26:07,695 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:26:07,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:26:07,736 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 11:26:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:26:07,911 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:26:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:26:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1464139891, now seen corresponding path program 1 times [2022-10-16 11:26:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:26:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243060884] [2022-10-16 11:26:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:26:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:26:07,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:26:07,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057601996] [2022-10-16 11:26:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:26:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:26:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:26:07,934 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 11:26:07,949 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 11:26:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:26:08,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 11:26:08,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:26:08,178 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 11:26:08,242 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 11:26:08,404 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 14 treesize of output 16 [2022-10-16 11:26:08,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:26:08,440 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 11:26:08,678 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 23 treesize of output 23 [2022-10-16 11:26:08,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:26:08,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:26:08,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:26:08,723 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 34 treesize of output 36 [2022-10-16 11:26:10,388 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 36 treesize of output 34 [2022-10-16 11:26:10,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:26:10,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:10,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:10,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:26:10,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 47 [2022-10-16 11:26:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:26:10,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:26:11,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |c_ULTIMATE.start_main_~index~0#1|) 4294967296))) (let ((.cse7 (<= .cse14 2147483647)) (.cse13 (* .cse14 4)) (.cse12 (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~pivot~0#1|) |c_ULTIMATE.start_main_~index~0#1|) 4294967296))) (let ((.cse0 (<= .cse12 2147483647)) (.cse6 (+ .cse13 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse1 (not .cse7)) (.cse3 (+ .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse8 (* .cse12 4))) (and (or .cse0 (let ((.cse4 (+ (- 17179869184) .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse1 (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ 2147483649 (select .cse2 .cse3) (select .cse2 .cse4)))))) (or (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ 2147483649 (select .cse5 .cse4) (select .cse5 .cse6))))) .cse7)))) (or (not .cse0) (let ((.cse10 (+ .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ 2147483649 (select .cse9 .cse10) (select .cse9 .cse6))))) .cse7) (or .cse1 (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ 2147483649 (select .cse11 .cse3) (select .cse11 .cse10))))))))))))) is different from false [2022-10-16 11:26:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:26:12,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243060884] [2022-10-16 11:26:12,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:26:12,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057601996] [2022-10-16 11:26:12,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057601996] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:26:12,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:26:12,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-10-16 11:26:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896347066] [2022-10-16 11:26:12,294 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:26:12,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 11:26:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:26:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 11:26:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=884, Unknown=1, NotChecked=60, Total=1056 [2022-10-16 11:26:12,296 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand has 28 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:26:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:26:14,441 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2022-10-16 11:26:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 11:26:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2022-10-16 11:26:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:26:14,444 INFO L225 Difference]: With dead ends: 135 [2022-10-16 11:26:14,444 INFO L226 Difference]: Without dead ends: 134 [2022-10-16 11:26:14,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=205, Invalid=1690, Unknown=1, NotChecked=84, Total=1980 [2022-10-16 11:26:14,445 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 65 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:26:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 534 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 852 Invalid, 0 Unknown, 241 Unchecked, 1.2s Time] [2022-10-16 11:26:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-16 11:26:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2022-10-16 11:26:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 11:26:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-10-16 11:26:14,463 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 67 [2022-10-16 11:26:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:26:14,463 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-10-16 11:26:14,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:26:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-10-16 11:26:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 11:26:14,464 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:26:14,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:26:14,477 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 11:26:14,669 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,SelfDestructingSolverStorable24 [2022-10-16 11:26:14,670 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:26:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:26:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1681737540, now seen corresponding path program 3 times [2022-10-16 11:26:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:26:14,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057828243] [2022-10-16 11:26:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:26:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:26:14,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:26:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483172095] [2022-10-16 11:26:14,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 11:26:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:26:14,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:26:14,686 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 11:26:14,693 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 11:26:14,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 11:26:14,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:26:14,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-16 11:26:14,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:26:14,901 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 11:26:14,961 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 11:26:15,012 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 23 [2022-10-16 11:26:15,173 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 35 treesize of output 34 [2022-10-16 11:26:15,248 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 40 treesize of output 40 [2022-10-16 11:26:15,506 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-10-16 11:26:15,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-10-16 11:26:15,608 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 39 treesize of output 37 [2022-10-16 11:26:15,985 INFO L356 Elim1Store]: treesize reduction 46, result has 48.9 percent of original size [2022-10-16 11:26:15,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2022-10-16 11:26:16,168 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 43 treesize of output 39 [2022-10-16 11:26:21,745 INFO L356 Elim1Store]: treesize reduction 134, result has 32.7 percent of original size [2022-10-16 11:26:21,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 106 [2022-10-16 11:26:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:26:22,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:26:31,684 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:26:40,189 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:27:00,542 WARN L233 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:27:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:27:00,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057828243] [2022-10-16 11:27:00,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:27:00,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483172095] [2022-10-16 11:27:00,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483172095] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:27:00,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:27:00,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2022-10-16 11:27:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882195293] [2022-10-16 11:27:00,546 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:27:00,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 11:27:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:27:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 11:27:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1536, Unknown=1, NotChecked=0, Total=1722 [2022-10-16 11:27:00,549 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 31 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:27:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:27:02,468 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2022-10-16 11:27:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 11:27:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 70 [2022-10-16 11:27:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:27:02,471 INFO L225 Difference]: With dead ends: 173 [2022-10-16 11:27:02,471 INFO L226 Difference]: Without dead ends: 172 [2022-10-16 11:27:02,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=259, Invalid=2190, Unknown=1, NotChecked=0, Total=2450 [2022-10-16 11:27:02,474 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 90 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 11:27:02,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 545 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 489 Invalid, 0 Unknown, 382 Unchecked, 0.6s Time] [2022-10-16 11:27:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-10-16 11:27:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2022-10-16 11:27:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 144 states have internal predecessors, (149), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 11:27:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 165 transitions. [2022-10-16 11:27:02,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 165 transitions. Word has length 70 [2022-10-16 11:27:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:27:02,493 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 165 transitions. [2022-10-16 11:27:02,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.206896551724138) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:27:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 165 transitions. [2022-10-16 11:27:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 11:27:02,494 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:27:02,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:27:02,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-10-16 11:27:02,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-16 11:27:02,699 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:27:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:27:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -853858987, now seen corresponding path program 1 times [2022-10-16 11:27:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:27:02,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019948541] [2022-10-16 11:27:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:27:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:27:02,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:27:02,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464799197] [2022-10-16 11:27:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:27:02,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:27:02,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:27:02,732 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 11:27:02,749 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 11:27:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:27:02,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-16 11:27:02,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:27:02,842 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 11:27:02,897 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 11:27:02,939 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 23 [2022-10-16 11:27:03,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:27:03,061 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 11:27:03,087 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 14 treesize of output 16 [2022-10-16 11:27:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:27:03,217 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 11:27:03,252 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 14 treesize of output 16 [2022-10-16 11:27:03,534 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 57 treesize of output 50 [2022-10-16 11:27:03,547 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-10-16 11:27:03,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2022-10-16 11:27:03,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:27:03,663 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-10-16 11:27:03,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 85 treesize of output 35 [2022-10-16 11:27:03,789 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 14 treesize of output 16 [2022-10-16 11:27:03,865 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 15 treesize of output 7 [2022-10-16 11:27:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:27:03,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:27:03,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (< (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 9223372036854775808)) is different from false [2022-10-16 11:27:04,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| |c_ULTIMATE.start_main_#t~mem10#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_ArrVal_564 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int) (v_ArrVal_566 (Array Int Int))) (or (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4)) v_ArrVal_564)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|) 9223372036854775808) (< |aux_mod_ULTIMATE.start_main_~index~0#1_49| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|))) (not (<= v_ArrVal_564 .cse1)))) (forall ((v_ArrVal_564 Int)) (or (not (<= v_ArrVal_564 .cse1)) (forall ((|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int) (v_ArrVal_566 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4)) v_ArrVal_564)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 9223372036854775808) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~index~0#1_49|))))))) is different from false [2022-10-16 11:27:04,203 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_ArrVal_564 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int) (v_ArrVal_566 (Array Int Int))) (or (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4)) v_ArrVal_564)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|) 9223372036854775808) (< |aux_mod_ULTIMATE.start_main_~index~0#1_49| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~index~0#1_49|) (< 2147483647 v_ArrVal_564))) (forall ((v_ArrVal_564 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_49| Int) (v_ArrVal_566 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_49| 4294967296) 4)) v_ArrVal_564)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 9223372036854775808) (<= |aux_mod_ULTIMATE.start_main_~index~0#1_49| 2147483647) (< 2147483647 v_ArrVal_564) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~index~0#1_49|))))) is different from false [2022-10-16 11:27:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:27:04,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019948541] [2022-10-16 11:27:04,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:27:04,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464799197] [2022-10-16 11:27:04,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464799197] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:27:04,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:27:04,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-10-16 11:27:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619613867] [2022-10-16 11:27:04,465 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:27:04,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 11:27:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:27:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 11:27:04,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=230, Unknown=3, NotChecked=102, Total=420 [2022-10-16 11:27:04,466 INFO L87 Difference]: Start difference. First operand 159 states and 165 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:27:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:27:04,892 INFO L93 Difference]: Finished difference Result 218 states and 227 transitions. [2022-10-16 11:27:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 11:27:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-10-16 11:27:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:27:04,895 INFO L225 Difference]: With dead ends: 218 [2022-10-16 11:27:04,895 INFO L226 Difference]: Without dead ends: 217 [2022-10-16 11:27:04,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=314, Unknown=3, NotChecked=120, Total=552 [2022-10-16 11:27:04,897 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 120 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:27:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 296 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2022-10-16 11:27:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-10-16 11:27:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2022-10-16 11:27:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 162 states have (on average 1.123456790123457) internal successors, (182), 172 states have internal predecessors, (182), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-16 11:27:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2022-10-16 11:27:04,926 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 71 [2022-10-16 11:27:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:27:04,927 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2022-10-16 11:27:04,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-16 11:27:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2022-10-16 11:27:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 11:27:04,928 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:27:04,928 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:27:04,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-10-16 11:27:05,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 11:27:05,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:27:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:27:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 594256285, now seen corresponding path program 2 times [2022-10-16 11:27:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:27:05,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506283156] [2022-10-16 11:27:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:27:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:27:05,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:27:05,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705760542] [2022-10-16 11:27:05,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:27:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:27:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:27:05,158 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 11:27:05,163 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 11:27:05,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:27:05,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:27:05,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 11:27:05,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:27:05,419 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 11:27:05,470 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 11:27:05,508 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 23 [2022-10-16 11:27:05,637 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 35 treesize of output 34 [2022-10-16 11:27:05,710 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 40 treesize of output 40 [2022-10-16 11:27:05,937 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-10-16 11:27:05,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-10-16 11:27:06,023 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 39 treesize of output 37 [2022-10-16 11:27:06,321 INFO L356 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-10-16 11:27:06,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-10-16 11:27:06,424 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 43 treesize of output 39 [2022-10-16 11:27:08,834 INFO L356 Elim1Store]: treesize reduction 82, result has 42.7 percent of original size [2022-10-16 11:27:08,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 101 treesize of output 100 [2022-10-16 11:27:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:27:09,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:27:18,854 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)