/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/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:04:41,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:04:41,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:04:41,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:04:41,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:04:41,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:04:41,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:04:41,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:04:41,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:04:41,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:04:41,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:04:41,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:04:41,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:04:41,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:04:41,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:04:41,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:04:41,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:04:41,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:04:41,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:04:41,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:04:41,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:04:41,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:04:41,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:04:41,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:04:41,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:04:41,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:04:41,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:04:41,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:04:41,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:04:41,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:04:41,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:04:41,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:04:41,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:04:41,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:04:41,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:04:41,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:04:41,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:04:41,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:04:41,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:04:41,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:04:41,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:04:41,513 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 12:04:41,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:04:41,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:04:41,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:04:41,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:04:41,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:04:41,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:04:41,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:04:41,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:04:41,572 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:04:41,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:04:41,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:04:41,574 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:04:41,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:04:41,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:04:41,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:04:41,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:04:41,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:04:41,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:04:41,575 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:04:41,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:04:41,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:04:41,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:04:41,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:04:41,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:04:41,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:04:41,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:04:41,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:04:41,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:04:41,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:04:41,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:04:41,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:04:41,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:04:41,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:04:41,578 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 12:04:42,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:04:42,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:04:42,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:04:42,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:04:42,071 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:04:42,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-10-16 12:04:42,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013b7496e/50ffd71570134aa5beb06faa8821f7c2/FLAG51594ecea [2022-10-16 12:04:42,831 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:04:42,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-10-16 12:04:42,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013b7496e/50ffd71570134aa5beb06faa8821f7c2/FLAG51594ecea [2022-10-16 12:04:43,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013b7496e/50ffd71570134aa5beb06faa8821f7c2 [2022-10-16 12:04:43,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:04:43,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:04:43,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:04:43,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:04:43,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:04:43,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d84017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43, skipping insertion in model container [2022-10-16 12:04:43,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:04:43,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:04:43,740 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/heap-data/shared_mem1.i[23879,23892] [2022-10-16 12:04:43,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:04:43,763 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:04:43,805 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/heap-data/shared_mem1.i[23879,23892] [2022-10-16 12:04:43,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:04:43,843 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:04:43,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43 WrapperNode [2022-10-16 12:04:43,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:04:43,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:04:43,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:04:43,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:04:43,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,913 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 84 [2022-10-16 12:04:43,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:04:43,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:04:43,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:04:43,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:04:43,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,978 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:04:43,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:04:43,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:04:43,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:04:43,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:04:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:44,036 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 12:04:44,061 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 12:04:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:04:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:04:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 12:04:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:04:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 12:04:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 12:04:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:04:44,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:04:44,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:04:44,223 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:04:44,225 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:04:44,548 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:04:44,556 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:04:44,556 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-16 12:04:44,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:44 BoogieIcfgContainer [2022-10-16 12:04:44,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:04:44,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:04:44,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:04:44,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:04:44,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:43" (1/3) ... [2022-10-16 12:04:44,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654cf28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:44, skipping insertion in model container [2022-10-16 12:04:44,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (2/3) ... [2022-10-16 12:04:44,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654cf28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:44, skipping insertion in model container [2022-10-16 12:04:44,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:44" (3/3) ... [2022-10-16 12:04:44,571 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-10-16 12:04:44,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:04:44,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 12:04:44,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:04:44,672 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;@347cbeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:04:44,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 12:04:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 12:04:44,687 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:44,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:44,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1819225339, now seen corresponding path program 1 times [2022-10-16 12:04:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521794325] [2022-10-16 12:04:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:44,966 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 12:04:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:44,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521794325] [2022-10-16 12:04:44,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521794325] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:44,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:44,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:04:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901540270] [2022-10-16 12:04:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:44,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:04:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:04:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:04:45,017 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:45,037 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-10-16 12:04:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:04:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 12:04:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:45,050 INFO L225 Difference]: With dead ends: 39 [2022-10-16 12:04:45,050 INFO L226 Difference]: Without dead ends: 19 [2022-10-16 12:04:45,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:04:45,059 INFO L413 NwaCegarLoop]: 26 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, 26 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 12:04:45,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:04:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-10-16 12:04:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-10-16 12:04:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-10-16 12:04:45,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 7 [2022-10-16 12:04:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:45,105 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-10-16 12:04:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-10-16 12:04:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 12:04:45,107 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:45,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:45,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:04:45,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:45,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 177878448, now seen corresponding path program 1 times [2022-10-16 12:04:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:45,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529848790] [2022-10-16 12:04:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:45,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:45,743 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 12:04:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529848790] [2022-10-16 12:04:45,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529848790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:45,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:45,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:04:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135169848] [2022-10-16 12:04:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:45,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:04:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:04:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:04:45,749 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:45,895 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-10-16 12:04:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:04:45,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 12:04:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:45,899 INFO L225 Difference]: With dead ends: 33 [2022-10-16 12:04:45,899 INFO L226 Difference]: Without dead ends: 32 [2022-10-16 12:04:45,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 12:04:45,902 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:45,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 57 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:04:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-16 12:04:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-10-16 12:04:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-10-16 12:04:45,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 8 [2022-10-16 12:04:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:45,922 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-10-16 12:04:45,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-10-16 12:04:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 12:04:45,924 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:45,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:45,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:04:45,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 177878640, now seen corresponding path program 1 times [2022-10-16 12:04:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795852580] [2022-10-16 12:04:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:46,600 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 12:04:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795852580] [2022-10-16 12:04:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795852580] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:46,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:46,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:04:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881183510] [2022-10-16 12:04:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:46,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:04:46,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:04:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:04:46,604 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:46,769 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-10-16 12:04:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:04:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 12:04:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:46,771 INFO L225 Difference]: With dead ends: 32 [2022-10-16 12:04:46,771 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 12:04:46,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:04:46,773 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:46,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:04:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 12:04:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-10-16 12:04:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-10-16 12:04:46,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 8 [2022-10-16 12:04:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:46,782 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-10-16 12:04:46,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-10-16 12:04:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:04:46,783 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:46,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:46,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:04:46,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1219264660, now seen corresponding path program 1 times [2022-10-16 12:04:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:46,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075126594] [2022-10-16 12:04:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:47,214 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 12:04:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:47,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075126594] [2022-10-16 12:04:47,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075126594] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:47,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:04:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96683360] [2022-10-16 12:04:47,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:47,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:04:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:47,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:04:47,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:04:47,218 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:47,424 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-10-16 12:04:47,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:04:47,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 12:04:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:47,428 INFO L225 Difference]: With dead ends: 30 [2022-10-16 12:04:47,428 INFO L226 Difference]: Without dead ends: 29 [2022-10-16 12:04:47,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:04:47,434 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:47,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 12:04:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-16 12:04:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-16 12:04:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-10-16 12:04:47,451 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 9 [2022-10-16 12:04:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:47,453 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-10-16 12:04:47,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-10-16 12:04:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:04:47,454 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:47,454 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:47,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:04:47,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 45642772, now seen corresponding path program 1 times [2022-10-16 12:04:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:47,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438220791] [2022-10-16 12:04:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:47,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438220791] [2022-10-16 12:04:47,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438220791] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:47,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221505553] [2022-10-16 12:04:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:47,927 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 12:04:47,951 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 12:04:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:48,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-16 12:04:48,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:48,178 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-10-16 12:04:48,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 56 treesize of output 94 [2022-10-16 12:04:48,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:48,234 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:04:48,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-16 12:04:48,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-10-16 12:04:48,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 41 [2022-10-16 12:04:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,594 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 24 treesize of output 21 [2022-10-16 12:04:48,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 12:04:48,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 12:04:48,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-16 12:04:48,712 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 31 treesize of output 23 [2022-10-16 12:04:48,722 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:48,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2022-10-16 12:04:48,731 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 16 treesize of output 12 [2022-10-16 12:04:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:48,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:48,822 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 45 treesize of output 33 [2022-10-16 12:04:48,825 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 33 treesize of output 21 [2022-10-16 12:04:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:49,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221505553] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:49,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:49,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-10-16 12:04:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309199884] [2022-10-16 12:04:49,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:49,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 12:04:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 12:04:49,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-10-16 12:04:49,088 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:49,494 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-10-16 12:04:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:04:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 12:04:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:49,497 INFO L225 Difference]: With dead ends: 39 [2022-10-16 12:04:49,497 INFO L226 Difference]: Without dead ends: 38 [2022-10-16 12:04:49,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-10-16 12:04:49,499 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 77 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:49,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 124 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 105 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-10-16 12:04:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-16 12:04:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-10-16 12:04:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-10-16 12:04:49,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 11 [2022-10-16 12:04:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:49,509 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-10-16 12:04:49,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-10-16 12:04:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:04:49,510 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:49,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:49,562 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 12:04:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:49,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 45642964, now seen corresponding path program 1 times [2022-10-16 12:04:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488163223] [2022-10-16 12:04:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488163223] [2022-10-16 12:04:50,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488163223] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280849433] [2022-10-16 12:04:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:50,548 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 12:04:50,568 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 12:04:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:50,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2022-10-16 12:04:50,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:50,694 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 18 treesize of output 19 [2022-10-16 12:04:50,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,712 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-10-16 12:04:50,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,727 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 0 case distinctions, treesize of input 30 treesize of output 30 [2022-10-16 12:04:50,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:50,751 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 18 treesize of output 19 [2022-10-16 12:04:50,770 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-16 12:04:50,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 30 [2022-10-16 12:04:50,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-10-16 12:04:50,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,955 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 23 [2022-10-16 12:04:50,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,973 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 51 treesize of output 44 [2022-10-16 12:04:50,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:50,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 12:04:51,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 12:04:51,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 22 [2022-10-16 12:04:51,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 [2022-10-16 12:04:51,056 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-10-16 12:04:51,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-10-16 12:04:51,176 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 35 treesize of output 23 [2022-10-16 12:04:51,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-10-16 12:04:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:51,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:51,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280849433] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:51,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:51,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-10-16 12:04:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678709482] [2022-10-16 12:04:51,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:51,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 12:04:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 12:04:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 12:04:51,483 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:51,825 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-10-16 12:04:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:04:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 12:04:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:51,827 INFO L225 Difference]: With dead ends: 38 [2022-10-16 12:04:51,827 INFO L226 Difference]: Without dead ends: 36 [2022-10-16 12:04:51,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-10-16 12:04:51,829 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:51,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-10-16 12:04:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-16 12:04:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-10-16 12:04:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-10-16 12:04:51,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 11 [2022-10-16 12:04:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:51,838 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-10-16 12:04:51,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-10-16 12:04:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:04:51,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:51,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:51,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 12:04:52,045 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,SelfDestructingSolverStorable5 [2022-10-16 12:04:52,046 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1414926000, now seen corresponding path program 1 times [2022-10-16 12:04:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:52,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055481091] [2022-10-16 12:04:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:52,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055481091] [2022-10-16 12:04:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055481091] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835677157] [2022-10-16 12:04:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:52,892 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 12:04:52,913 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 12:04:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:53,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 58 conjunts are in the unsatisfiable core [2022-10-16 12:04:53,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:53,057 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 18 treesize of output 19 [2022-10-16 12:04:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,072 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-10-16 12:04:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,085 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 0 case distinctions, treesize of input 30 treesize of output 30 [2022-10-16 12:04:53,093 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 18 treesize of output 19 [2022-10-16 12:04:53,109 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-16 12:04:53,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 30 [2022-10-16 12:04:53,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-10-16 12:04:53,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:53,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,268 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 23 [2022-10-16 12:04:53,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,286 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 51 treesize of output 44 [2022-10-16 12:04:53,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 12:04:53,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 22 [2022-10-16 12:04:53,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 [2022-10-16 12:04:53,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:53,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 12:04:53,361 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-10-16 12:04:53,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-10-16 12:04:53,472 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 35 treesize of output 23 [2022-10-16 12:04:53,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-10-16 12:04:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:53,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:53,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835677157] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:53,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:53,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-10-16 12:04:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847617265] [2022-10-16 12:04:53,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:53,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 12:04:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 12:04:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-16 12:04:53,802 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:54,098 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-10-16 12:04:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:04:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 12:04:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:54,099 INFO L225 Difference]: With dead ends: 34 [2022-10-16 12:04:54,100 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 12:04:54,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 12:04:54,101 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:54,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 83 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2022-10-16 12:04:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 12:04:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-10-16 12:04:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-10-16 12:04:54,108 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 12 [2022-10-16 12:04:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:54,108 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-10-16 12:04:54,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-10-16 12:04:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:04:54,109 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:54,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:54,152 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 12:04:54,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:54,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1352190687, now seen corresponding path program 1 times [2022-10-16 12:04:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:54,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432838426] [2022-10-16 12:04:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:54,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432838426] [2022-10-16 12:04:54,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432838426] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:54,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100578650] [2022-10-16 12:04:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:54,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:54,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:54,911 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 12:04:54,917 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 12:04:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:55,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-16 12:04:55,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:55,047 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 18 treesize of output 19 [2022-10-16 12:04:55,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,063 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 24 treesize of output 24 [2022-10-16 12:04:55,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:55,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:04:55,086 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 16 treesize of output 14 [2022-10-16 12:04:55,266 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:04:55,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-10-16 12:04:55,273 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 20 treesize of output 22 [2022-10-16 12:04:55,287 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 22 treesize of output 24 [2022-10-16 12:04:55,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-10-16 12:04:55,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-10-16 12:04:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 12:04:55,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:55,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_613)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_614)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_612)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ .cse3 4))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< (+ .cse0 (select (select .cse1 .cse2) .cse3)) 2147483648) (< 100 .cse0)))))) is different from false [2022-10-16 12:04:55,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_613)) (.cse4 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_614)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| .cse8 v_ArrVal_612)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ .cse3 4))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< 100 .cse0) (< (+ .cse0 (select (select .cse1 .cse2) .cse3)) 2147483648))))))) is different from false [2022-10-16 12:04:55,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_613)) (.cse4 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_614)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| .cse8 v_ArrVal_612)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ 4 .cse3))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< (+ .cse0 (select (select .cse1 .cse2) .cse3)) 2147483648) (< 100 .cse0))))))) is different from false [2022-10-16 12:04:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-16 12:04:55,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100578650] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:55,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:55,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 20 [2022-10-16 12:04:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631707963] [2022-10-16 12:04:55,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:55,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 12:04:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:55,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 12:04:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-10-16 12:04:55,828 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:57,152 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-10-16 12:04:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 12:04:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:04:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:57,155 INFO L225 Difference]: With dead ends: 52 [2022-10-16 12:04:57,155 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 12:04:57,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=519, Unknown=3, NotChecked=156, Total=870 [2022-10-16 12:04:57,158 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:57,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 191 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 181 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2022-10-16 12:04:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 12:04:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-10-16 12:04:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-10-16 12:04:57,174 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 15 [2022-10-16 12:04:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:57,174 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-10-16 12:04:57,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-10-16 12:04:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:04:57,176 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:57,177 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:57,204 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 12:04:57,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:57,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1352190879, now seen corresponding path program 1 times [2022-10-16 12:04:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:57,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683447156] [2022-10-16 12:04:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683447156] [2022-10-16 12:04:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683447156] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513757200] [2022-10-16 12:04:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:58,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:58,319 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 12:04:58,342 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 12:04:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:58,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 62 conjunts are in the unsatisfiable core [2022-10-16 12:04:58,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:58,455 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-10-16 12:04:58,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:58,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:04:58,467 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 16 treesize of output 14 [2022-10-16 12:04:58,472 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 20 treesize of output 22 [2022-10-16 12:04:58,480 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 18 treesize of output 19 [2022-10-16 12:04:58,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:04:58,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2022-10-16 12:04:58,743 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 35 [2022-10-16 12:04:58,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-10-16 12:04:58,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-10-16 12:04:58,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2022-10-16 12:04:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:58,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:59,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (or (not (<= v_ArrVal_698 (+ |c_ULTIMATE.start_main_#t~mem12#1| |c_ULTIMATE.start_main_#t~mem11#1|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_696)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_697)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base|) |c_ULTIMATE.start_main_#t~mem10#1.offset| v_ArrVal_698))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (< (let ((.cse3 (+ 4 .cse5))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) (+ (select (select .cse0 .cse2) .cse5) 2147483648)))))) is different from false [2022-10-16 12:04:59,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse10))) (let ((.cse8 (select |c_#memory_int| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse10))) (or (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_696)) (.cse1 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_697)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store .cse8 .cse9 v_ArrVal_698))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (< (let ((.cse3 (+ 4 .cse5))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) (+ (select (select .cse0 .cse2) .cse5) 2147483648)))) (< (+ (select .cse8 .cse9) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_698)))))) is different from false [2022-10-16 12:04:59,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))) (let ((.cse0 (select |c_#memory_int| .cse9)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))) (or (< (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_698) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_696)) (.cse3 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_697)) (.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_int| .cse9 (store .cse0 .cse1 v_ArrVal_698))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (< (let ((.cse5 (+ .cse7 4))) (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))) (+ (select (select .cse2 .cse4) .cse7) 2147483648))))))))) is different from false [2022-10-16 12:04:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 12:04:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513757200] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:59,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 19 [2022-10-16 12:04:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376129536] [2022-10-16 12:04:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 12:04:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:59,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 12:04:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=234, Unknown=3, NotChecked=96, Total=380 [2022-10-16 12:04:59,251 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:00,633 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-10-16 12:05:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 12:05:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:05:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:00,634 INFO L225 Difference]: With dead ends: 59 [2022-10-16 12:05:00,634 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 12:05:00,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=425, Unknown=3, NotChecked=138, Total=702 [2022-10-16 12:05:00,636 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:00,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 150 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 184 Invalid, 0 Unknown, 89 Unchecked, 0.4s Time] [2022-10-16 12:05:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 12:05:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-10-16 12:05:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-10-16 12:05:00,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 15 [2022-10-16 12:05:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:00,657 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-10-16 12:05:00,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-10-16 12:05:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:05:00,658 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:00,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:00,689 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 12:05:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:00,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1031761595, now seen corresponding path program 1 times [2022-10-16 12:05:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:00,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224926296] [2022-10-16 12:05:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224926296] [2022-10-16 12:05:01,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224926296] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510415882] [2022-10-16 12:05:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:01,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:01,765 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 12:05:01,789 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 12:05:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:01,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 12:05:01,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:01,890 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 18 treesize of output 19 [2022-10-16 12:05:01,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,904 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-10-16 12:05:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,913 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 0 case distinctions, treesize of input 30 treesize of output 30 [2022-10-16 12:05:01,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:05:01,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:01,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:01,934 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 16 treesize of output 14 [2022-10-16 12:05:01,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-10-16 12:05:02,257 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:02,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2022-10-16 12:05:02,270 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-10-16 12:05:02,278 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 56 treesize of output 54 [2022-10-16 12:05:02,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-10-16 12:05:02,527 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 12:05:02,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-10-16 12:05:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:02,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:02,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (or (< 0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_785)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_782)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base|) |c_ULTIMATE.start_main_#t~mem10#1.offset| v_ArrVal_783))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ 2147483649 (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4))))))) (not (<= (+ |c_ULTIMATE.start_main_#t~mem12#1| |c_ULTIMATE.start_main_#t~mem11#1|) v_ArrVal_783)))) is different from false [2022-10-16 12:05:02,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse10))) (let ((.cse0 (select |c_#memory_int| .cse9)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse10))) (or (< v_ArrVal_783 (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (< 0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_785)) (.cse3 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_782)) (.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_int| .cse9 (store .cse0 .cse1 v_ArrVal_783))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (+ 2147483649 (let ((.cse5 (+ .cse7 4))) (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))) (select (select .cse2 .cse4) .cse7)))))))))) is different from false [2022-10-16 12:05:02,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))) (let ((.cse8 (select |c_#memory_int| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10))) (or (< 0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_785)) (.cse3 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_782)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store .cse8 .cse9 v_ArrVal_783))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (+ 2147483649 (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4))))))) (< v_ArrVal_783 (+ (select .cse8 .cse9) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2022-10-16 12:05:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-16 12:05:02,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510415882] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:05:02,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:05:02,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 19 [2022-10-16 12:05:02,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588989615] [2022-10-16 12:05:02,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:05:02,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 12:05:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:05:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 12:05:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=222, Unknown=3, NotChecked=96, Total=380 [2022-10-16 12:05:02,818 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:03,867 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-10-16 12:05:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 12:05:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 12:05:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:03,869 INFO L225 Difference]: With dead ends: 48 [2022-10-16 12:05:03,869 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 12:05:03,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=353, Unknown=3, NotChecked=126, Total=600 [2022-10-16 12:05:03,870 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:03,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 148 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2022-10-16 12:05:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 12:05:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-10-16 12:05:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-10-16 12:05:03,878 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 16 [2022-10-16 12:05:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-10-16 12:05:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-10-16 12:05:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:05:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:03,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:03,922 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 12:05:04,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:04,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1031755637, now seen corresponding path program 1 times [2022-10-16 12:05:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:04,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899802702] [2022-10-16 12:05:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899802702] [2022-10-16 12:05:04,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899802702] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375453637] [2022-10-16 12:05:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:04,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:04,551 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 12:05:04,566 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 12:05:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:04,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 12:05:04,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:04,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:04,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:04,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:04,683 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 24 treesize of output 24 [2022-10-16 12:05:04,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:04,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:05:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:04,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:04,702 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 16 treesize of output 14 [2022-10-16 12:05:04,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:04,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-10-16 12:05:04,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-10-16 12:05:04,895 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 20 treesize of output 22 [2022-10-16 12:05:05,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-10-16 12:05:05,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-10-16 12:05:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 12:05:05,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:05:05,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375453637] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:05:05,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:05:05,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-10-16 12:05:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100521647] [2022-10-16 12:05:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:05:05,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:05:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:05:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:05:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-10-16 12:05:05,061 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:05,360 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-10-16 12:05:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 12:05:05,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 12:05:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:05,362 INFO L225 Difference]: With dead ends: 43 [2022-10-16 12:05:05,362 INFO L226 Difference]: Without dead ends: 42 [2022-10-16 12:05:05,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-16 12:05:05,364 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:05,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 12:05:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-16 12:05:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-10-16 12:05:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-10-16 12:05:05,375 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 16 [2022-10-16 12:05:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:05,376 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-10-16 12:05:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-10-16 12:05:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:05:05,377 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:05,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:05,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-16 12:05:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:05,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1215409157, now seen corresponding path program 1 times [2022-10-16 12:05:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:05,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608420473] [2022-10-16 12:05:05,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608420473] [2022-10-16 12:05:06,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608420473] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:06,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95533505] [2022-10-16 12:05:06,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:06,938 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 12:05:06,940 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 12:05:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:07,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 67 conjunts are in the unsatisfiable core [2022-10-16 12:05:07,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:07,087 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 18 treesize of output 19 [2022-10-16 12:05:07,098 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-16 12:05:07,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 30 [2022-10-16 12:05:07,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-10-16 12:05:07,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,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 0 case distinctions, treesize of input 16 treesize of output 16 [2022-10-16 12:05:07,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-10-16 12:05:07,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,222 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 38 treesize of output 33 [2022-10-16 12:05:07,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 28 [2022-10-16 12:05:07,257 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-10-16 12:05:07,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2022-10-16 12:05:07,268 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 20 treesize of output 22 [2022-10-16 12:05:07,497 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:07,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 77 [2022-10-16 12:05:07,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 12:05:07,513 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 22 treesize of output 24 [2022-10-16 12:05:07,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 12:05:07,707 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 12:05:07,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 68 [2022-10-16 12:05:07,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2022-10-16 12:05:07,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:07,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2022-10-16 12:05:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:07,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:07,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1021)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1019)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1020)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ .cse3 4))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< (+ .cse0 (select (select .cse1 .cse2) .cse3)) 2147483648) (< 100 .cse0)))))) is different from false [2022-10-16 12:05:07,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1021)) (.cse4 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1019)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| .cse8 v_ArrVal_1020)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ .cse3 4))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< 100 .cse0) (< (+ .cse0 (select (select .cse1 .cse2) .cse3)) 2147483648))))))) is different from false [2022-10-16 12:05:07,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1021)) (.cse4 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1019)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_int| .cse8 v_ArrVal_1020)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse0 (let ((.cse5 (+ 4 .cse3))) (select (select .cse1 (select (select .cse4 .cse2) .cse5)) (select (select .cse6 .cse2) .cse5))))) (or (< 100 .cse0) (< (+ (select (select .cse1 .cse2) .cse3) .cse0) 2147483648))))))) is different from false [2022-10-16 12:05:08,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:08,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 805 treesize of output 787 [2022-10-16 12:05:08,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:08,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1589715 treesize of output 1553481 [2022-10-16 12:06:11,198 WARN L233 SmtUtils]: Spent 1.03m on a formula simplification that was a NOOP. DAG size: 1747 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-16 12:06:11,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:06:11,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 29 select indices, 29 select index equivalence classes, 0 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 406 case distinctions, treesize of input 41208090 treesize of output 35002228 [2022-10-16 12:06:35,465 WARN L233 SmtUtils]: Spent 24.25s on a formula simplification that was a NOOP. DAG size: 4766 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-16 12:06:38,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:06:38,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 34972384 treesize of output 34711402 [2022-10-16 12:07:02,796 WARN L233 SmtUtils]: Spent 24.27s on a formula simplification that was a NOOP. DAG size: 4807 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-16 12:07:27,321 WARN L233 SmtUtils]: Spent 24.25s on a formula simplification that was a NOOP. DAG size: 4824 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-16 12:07:51,699 INFO L244 Elim1Store]: Index analysis took 23062 ms