/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/ldv-memsafety/ArraysOfVariableLength2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:44:44,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:44:44,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:44:44,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:44:44,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:44:44,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:44:44,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:44:44,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:44:44,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:44:44,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:44:44,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:44:44,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:44:44,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:44:44,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:44:44,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:44:44,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:44:44,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:44:44,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:44:44,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:44:44,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:44:44,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:44:44,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:44:44,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:44:44,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:44:44,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:44:44,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:44:44,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:44:44,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:44:44,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:44:44,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:44:44,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:44:44,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:44:44,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:44:44,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:44:44,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:44:44,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:44:44,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:44:44,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:44:44,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:44:44,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:44:44,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:44:44,515 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 13:44:44,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:44:44,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:44:44,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:44:44,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:44:44,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:44:44,563 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:44:44,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:44:44,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:44:44,565 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:44:44,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:44:44,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:44:44,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:44:44,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:44:44,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:44:44,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:44:44,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:44:44,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:44:44,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:44:44,569 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:44:44,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:44:44,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:44:44,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:44:44,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:44:44,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:44:44,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:44:44,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:44:44,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:44:44,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:44:44,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:44:44,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:44:44,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:44:44,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:44:44,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:44:44,573 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 13:44:45,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:44:45,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:44:45,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:44:45,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:44:45,064 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:44:45,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-10-16 13:44:45,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820565275/ec66964f28544da6baa964fe33d2bb89/FLAG2019e217e [2022-10-16 13:44:45,751 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:44:45,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-10-16 13:44:45,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820565275/ec66964f28544da6baa964fe33d2bb89/FLAG2019e217e [2022-10-16 13:44:46,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820565275/ec66964f28544da6baa964fe33d2bb89 [2022-10-16 13:44:46,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:44:46,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:44:46,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:44:46,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:44:46,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:44:46,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577cc6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46, skipping insertion in model container [2022-10-16 13:44:46,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:44:46,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:44:46,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:44:46,354 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:44:46,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:44:46,392 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:44:46,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46 WrapperNode [2022-10-16 13:44:46,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:44:46,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:44:46,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:44:46,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:44:46,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,438 INFO L138 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-10-16 13:44:46,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:44:46,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:44:46,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:44:46,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:44:46,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,467 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:44:46,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:44:46,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:44:46,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:44:46,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (1/1) ... [2022-10-16 13:44:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:44:46,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:46,510 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 13:44:46,539 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 13:44:46,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:44:46,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:44:46,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:44:46,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:44:46,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:44:46,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:44:46,692 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:44:46,694 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:44:47,039 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:44:47,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:44:47,058 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 13:44:47,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:47 BoogieIcfgContainer [2022-10-16 13:44:47,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:44:47,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:44:47,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:44:47,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:44:47,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:44:46" (1/3) ... [2022-10-16 13:44:47,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a85c847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:47, skipping insertion in model container [2022-10-16 13:44:47,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:46" (2/3) ... [2022-10-16 13:44:47,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a85c847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:47, skipping insertion in model container [2022-10-16 13:44:47,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:47" (3/3) ... [2022-10-16 13:44:47,088 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2022-10-16 13:44:47,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:44:47,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-16 13:44:47,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:44:47,211 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;@3503a45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:44:47,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-16 13:44:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 36 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 13:44:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 13:44:47,226 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:47,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 13:44:47,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:47,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 889666572, now seen corresponding path program 1 times [2022-10-16 13:44:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:47,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398311639] [2022-10-16 13:44:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:47,729 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 13:44:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398311639] [2022-10-16 13:44:47,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398311639] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:47,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:47,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:44:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467258547] [2022-10-16 13:44:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:47,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:44:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:47,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:44:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:44:47,780 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 36 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:44:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:47,891 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-10-16 13:44:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:44:47,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-10-16 13:44:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:47,905 INFO L225 Difference]: With dead ends: 101 [2022-10-16 13:44:47,905 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 13:44:47,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:47,915 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 66 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:47,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 13:44:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2022-10-16 13:44:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 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 13:44:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-10-16 13:44:47,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 6 [2022-10-16 13:44:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:47,966 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-10-16 13:44:47,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:44:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-10-16 13:44:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 13:44:47,967 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:47,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:47,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:44:47,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1809808564, now seen corresponding path program 1 times [2022-10-16 13:44:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:47,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210898810] [2022-10-16 13:44:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:48,196 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 13:44:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:48,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210898810] [2022-10-16 13:44:48,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210898810] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:48,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:48,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:44:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178785708] [2022-10-16 13:44:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:48,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:44:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:44:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:48,209 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 13:44:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:48,335 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-10-16 13:44:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:44:48,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 13:44:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:48,338 INFO L225 Difference]: With dead ends: 77 [2022-10-16 13:44:48,339 INFO L226 Difference]: Without dead ends: 50 [2022-10-16 13:44:48,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:44:48,344 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:48,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-16 13:44:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2022-10-16 13:44:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.44) internal successors, (36), 32 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 13:44:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-10-16 13:44:48,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2022-10-16 13:44:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:48,366 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-10-16 13:44:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 13:44:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-10-16 13:44:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:44:48,369 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:48,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:48,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:44:48,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1561360106, now seen corresponding path program 1 times [2022-10-16 13:44:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93020798] [2022-10-16 13:44:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:48,509 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 13:44:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:48,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93020798] [2022-10-16 13:44:48,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93020798] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:48,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:48,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:44:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020311388] [2022-10-16 13:44:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:44:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:44:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:48,513 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:48,571 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-10-16 13:44:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:44:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 13:44:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:48,578 INFO L225 Difference]: With dead ends: 82 [2022-10-16 13:44:48,578 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 13:44:48,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:44:48,589 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:48,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:44:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 13:44:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-10-16 13:44:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 13:44:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-10-16 13:44:48,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2022-10-16 13:44:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:48,609 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-10-16 13:44:48,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-10-16 13:44:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 13:44:48,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:48,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:48,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:44:48,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1561300524, now seen corresponding path program 1 times [2022-10-16 13:44:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:48,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308123481] [2022-10-16 13:44:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:48,742 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 13:44:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308123481] [2022-10-16 13:44:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308123481] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:48,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:48,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:44:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895136110] [2022-10-16 13:44:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:44:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:44:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:44:48,745 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:48,776 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-10-16 13:44:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:44:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 13:44:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:48,778 INFO L225 Difference]: With dead ends: 46 [2022-10-16 13:44:48,778 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 13:44:48,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:48,780 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:48,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:44:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 13:44:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-16 13:44:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 43 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 13:44:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-10-16 13:44:48,788 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 12 [2022-10-16 13:44:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:48,788 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-10-16 13:44:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 13:44:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-10-16 13:44:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 13:44:48,789 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:48,789 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:48,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:44:48,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -172018475, now seen corresponding path program 1 times [2022-10-16 13:44:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:48,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881006525] [2022-10-16 13:44:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:48,869 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 13:44:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:48,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881006525] [2022-10-16 13:44:48,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881006525] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:48,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:48,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:44:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434292959] [2022-10-16 13:44:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:48,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:44:48,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:44:48,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:44:48,873 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:48,912 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-10-16 13:44:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:44:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 13:44:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:48,913 INFO L225 Difference]: With dead ends: 75 [2022-10-16 13:44:48,914 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 13:44:48,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:48,915 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:48,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:44:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 13:44:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2022-10-16 13:44:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.325) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-10-16 13:44:48,925 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 17 [2022-10-16 13:44:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:48,926 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-10-16 13:44:48,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-10-16 13:44:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:44:48,927 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:48,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:44:48,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1037656821, now seen corresponding path program 1 times [2022-10-16 13:44:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:48,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893765412] [2022-10-16 13:44:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:49,077 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 13:44:49,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:49,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893765412] [2022-10-16 13:44:49,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893765412] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:49,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569134124] [2022-10-16 13:44:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:49,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:49,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:49,084 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 13:44:49,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 13:44:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:49,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 13:44:49,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:49,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:49,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569134124] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:49,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:49,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-10-16 13:44:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015936597] [2022-10-16 13:44:49,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:49,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 13:44:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 13:44:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:44:49,335 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 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 13:44:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:49,430 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-10-16 13:44:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:44:49,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 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 18 [2022-10-16 13:44:49,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:49,432 INFO L225 Difference]: With dead ends: 82 [2022-10-16 13:44:49,432 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 13:44:49,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-10-16 13:44:49,433 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:49,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 136 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 13:44:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-10-16 13:44:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 13:44:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-10-16 13:44:49,441 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2022-10-16 13:44:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:49,442 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-10-16 13:44:49,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 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 13:44:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-10-16 13:44:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 13:44:49,443 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:49,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:49,480 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 13:44:49,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 13:44:49,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -422049583, now seen corresponding path program 1 times [2022-10-16 13:44:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:49,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174517553] [2022-10-16 13:44:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:49,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:49,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174517553] [2022-10-16 13:44:49,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174517553] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046092860] [2022-10-16 13:44:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:49,776 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 13:44:49,806 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 13:44:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:49,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 13:44:49,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:49,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046092860] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:50,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:50,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-10-16 13:44:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910046895] [2022-10-16 13:44:50,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:50,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 13:44:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 13:44:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-10-16 13:44:50,072 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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 13:44:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:50,368 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2022-10-16 13:44:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 13:44:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 13:44:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:50,370 INFO L225 Difference]: With dead ends: 140 [2022-10-16 13:44:50,370 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 13:44:50,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-10-16 13:44:50,372 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 197 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 219 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 13:44:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 56. [2022-10-16 13:44:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-10-16 13:44:50,383 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2022-10-16 13:44:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:50,383 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-10-16 13:44:50,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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 13:44:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-10-16 13:44:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 13:44:50,384 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:50,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:50,424 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 13:44:50,598 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,SelfDestructingSolverStorable6 [2022-10-16 13:44:50,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -198686577, now seen corresponding path program 1 times [2022-10-16 13:44:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:50,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927826984] [2022-10-16 13:44:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927826984] [2022-10-16 13:44:51,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927826984] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144301675] [2022-10-16 13:44:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:51,215 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 13:44:51,219 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 13:44:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:51,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 13:44:51,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:51,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 13:44:51,464 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-16 13:44:51,465 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 1 case distinctions, treesize of input 26 treesize of output 29 [2022-10-16 13:44:51,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:44:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:51,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:51,761 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 14 treesize of output 12 [2022-10-16 13:44:51,766 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 22 treesize of output 20 [2022-10-16 13:44:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:44:51,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144301675] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:51,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:51,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-10-16 13:44:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537262387] [2022-10-16 13:44:51,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:51,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 13:44:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 13:44:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-10-16 13:44:51,792 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 13:44:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:52,495 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2022-10-16 13:44:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 13:44:52,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 13:44:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:52,497 INFO L225 Difference]: With dead ends: 129 [2022-10-16 13:44:52,497 INFO L226 Difference]: Without dead ends: 127 [2022-10-16 13:44:52,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 13:44:52,499 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 192 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:52,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 316 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 314 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2022-10-16 13:44:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-10-16 13:44:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 85. [2022-10-16 13:44:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 84 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 13:44:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2022-10-16 13:44:52,517 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 22 [2022-10-16 13:44:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:52,517 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2022-10-16 13:44:52,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 13:44:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-10-16 13:44:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 13:44:52,519 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:52,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:52,557 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 13:44:52,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:52,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -606811943, now seen corresponding path program 1 times [2022-10-16 13:44:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:52,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099492209] [2022-10-16 13:44:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 13:44:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:52,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099492209] [2022-10-16 13:44:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099492209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:52,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:44:52,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 13:44:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56942484] [2022-10-16 13:44:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:52,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:44:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:44:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:44:52,828 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 13:44:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:52,863 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2022-10-16 13:44:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 13:44:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 13:44:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:52,864 INFO L225 Difference]: With dead ends: 129 [2022-10-16 13:44:52,865 INFO L226 Difference]: Without dead ends: 127 [2022-10-16 13:44:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:44:52,866 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:52,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:44:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-10-16 13:44:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2022-10-16 13:44:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 93 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2022-10-16 13:44:52,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 25 [2022-10-16 13:44:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:52,883 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2022-10-16 13:44:52,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 13:44:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2022-10-16 13:44:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 13:44:52,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:52,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:52,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 13:44:52,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -450636071, now seen corresponding path program 1 times [2022-10-16 13:44:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:52,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114717285] [2022-10-16 13:44:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:53,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:53,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114717285] [2022-10-16 13:44:53,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114717285] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:53,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114382175] [2022-10-16 13:44:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:53,043 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 13:44:53,050 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 13:44:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:53,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 13:44:53,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:53,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:53,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114382175] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:53,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:53,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-10-16 13:44:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178064224] [2022-10-16 13:44:53,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-16 13:44:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-16 13:44:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:44:53,249 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:53,513 INFO L93 Difference]: Finished difference Result 181 states and 217 transitions. [2022-10-16 13:44:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 13:44:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 13:44:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:53,524 INFO L225 Difference]: With dead ends: 181 [2022-10-16 13:44:53,524 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 13:44:53,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-10-16 13:44:53,527 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 195 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:53,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 198 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 13:44:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2022-10-16 13:44:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 102 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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 13:44:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2022-10-16 13:44:53,558 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 27 [2022-10-16 13:44:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:53,559 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2022-10-16 13:44:53,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2022-10-16 13:44:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 13:44:53,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:53,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:53,603 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 13:44:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:53,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -17169899, now seen corresponding path program 1 times [2022-10-16 13:44:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591097926] [2022-10-16 13:44:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591097926] [2022-10-16 13:44:53,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591097926] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115277853] [2022-10-16 13:44:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:53,941 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 13:44:53,949 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 13:44:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:54,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 13:44:54,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:54,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:44:54,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115277853] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:54,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:54,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 13:44:54,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687316853] [2022-10-16 13:44:54,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:54,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 13:44:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 13:44:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-10-16 13:44:54,217 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:54,432 INFO L93 Difference]: Finished difference Result 192 states and 232 transitions. [2022-10-16 13:44:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 13:44:54,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 13:44:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:54,436 INFO L225 Difference]: With dead ends: 192 [2022-10-16 13:44:54,436 INFO L226 Difference]: Without dead ends: 115 [2022-10-16 13:44:54,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-10-16 13:44:54,437 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 142 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:54,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 219 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-16 13:44:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-10-16 13:44:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 97 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2022-10-16 13:44:54,453 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 28 [2022-10-16 13:44:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:54,453 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2022-10-16 13:44:54,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-10-16 13:44:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 13:44:54,455 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:54,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:54,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-16 13:44:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-16 13:44:54,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 110979782, now seen corresponding path program 1 times [2022-10-16 13:44:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:54,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493476277] [2022-10-16 13:44:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-16 13:44:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:54,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493476277] [2022-10-16 13:44:54,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493476277] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:54,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030141456] [2022-10-16 13:44:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:54,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:54,790 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 13:44:54,813 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 13:44:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:54,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 13:44:54,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-16 13:44:54,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:44:54,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030141456] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:44:54,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:44:54,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 13:44:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290106500] [2022-10-16 13:44:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:44:54,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:44:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:44:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:44:54,909 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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 13:44:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:54,961 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-10-16 13:44:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:44:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-10-16 13:44:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:54,963 INFO L225 Difference]: With dead ends: 98 [2022-10-16 13:44:54,963 INFO L226 Difference]: Without dead ends: 97 [2022-10-16 13:44:54,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:44:54,964 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:54,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 103 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 13:44:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-16 13:44:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-10-16 13:44:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 96 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 13:44:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-10-16 13:44:54,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 43 [2022-10-16 13:44:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:54,979 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-10-16 13:44:54,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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 13:44:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-10-16 13:44:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 13:44:54,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:54,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:55,018 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 13:44:55,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:55,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -856188810, now seen corresponding path program 1 times [2022-10-16 13:44:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:55,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559646371] [2022-10-16 13:44:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:55,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:55,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559646371] [2022-10-16 13:44:55,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559646371] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:55,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13211986] [2022-10-16 13:44:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:55,477 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 13:44:55,500 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 13:44:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:55,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 13:44:55,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:55,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:55,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13211986] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:55,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:55,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2022-10-16 13:44:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716401459] [2022-10-16 13:44:55,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:55,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 13:44:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:55,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 13:44:55,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-16 13:44:55,782 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:56,050 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2022-10-16 13:44:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 13:44:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 13:44:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:56,052 INFO L225 Difference]: With dead ends: 143 [2022-10-16 13:44:56,052 INFO L226 Difference]: Without dead ends: 79 [2022-10-16 13:44:56,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-10-16 13:44:56,053 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:56,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 263 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:44:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-16 13:44:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-10-16 13:44:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 13:44:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-10-16 13:44:56,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 44 [2022-10-16 13:44:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:56,064 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-10-16 13:44:56,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-10-16 13:44:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-16 13:44:56,066 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:56,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:56,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 13:44:56,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:56,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -926084628, now seen corresponding path program 1 times [2022-10-16 13:44:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256955630] [2022-10-16 13:44:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:56,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256955630] [2022-10-16 13:44:56,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256955630] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:56,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387833902] [2022-10-16 13:44:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:56,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:56,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:56,598 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 13:44:56,604 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 13:44:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:56,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-16 13:44:56,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:56,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:44:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 13:44:57,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387833902] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:44:57,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:44:57,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-10-16 13:44:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108511526] [2022-10-16 13:44:57,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:44:57,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 13:44:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:44:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 13:44:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-10-16 13:44:57,015 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:44:57,455 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2022-10-16 13:44:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 13:44:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-16 13:44:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:44:57,457 INFO L225 Difference]: With dead ends: 146 [2022-10-16 13:44:57,457 INFO L226 Difference]: Without dead ends: 108 [2022-10-16 13:44:57,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 13:44:57,459 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 216 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:44:57,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 406 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:44:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-16 13:44:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2022-10-16 13:44:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-10-16 13:44:57,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 46 [2022-10-16 13:44:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:44:57,473 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-10-16 13:44:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:44:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-10-16 13:44:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 13:44:57,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:44:57,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:44:57,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 13:44:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 13:44:57,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:44:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:44:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1356096212, now seen corresponding path program 1 times [2022-10-16 13:44:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:44:57,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988476272] [2022-10-16 13:44:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:44:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:44:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:44:58,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988476272] [2022-10-16 13:44:58,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988476272] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:44:58,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546376717] [2022-10-16 13:44:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:44:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:44:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:44:58,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:44:58,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 13:44:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:44:58,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 13:44:58,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:44:58,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 13:44:59,034 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 13:44:59,034 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 1 case distinctions, treesize of input 23 treesize of output 18 [2022-10-16 13:44:59,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:44:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:44:59,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:45:07,399 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 14 treesize of output 12 [2022-10-16 13:45:07,402 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 22 treesize of output 20 [2022-10-16 13:45:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 13:45:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546376717] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:45:07,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:45:07,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 31 [2022-10-16 13:45:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461322877] [2022-10-16 13:45:07,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:45:07,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 13:45:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:45:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 13:45:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=826, Unknown=1, NotChecked=0, Total=930 [2022-10-16 13:45:07,496 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:45:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:45:08,215 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2022-10-16 13:45:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:45:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 13:45:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:45:08,216 INFO L225 Difference]: With dead ends: 142 [2022-10-16 13:45:08,216 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 13:45:08,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=332, Invalid=1829, Unknown=1, NotChecked=0, Total=2162 [2022-10-16 13:45:08,219 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 147 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:45:08,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 277 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 311 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-10-16 13:45:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 13:45:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2022-10-16 13:45:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.144736842105263) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 13:45:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-10-16 13:45:08,235 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 47 [2022-10-16 13:45:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:45:08,236 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-10-16 13:45:08,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:45:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-10-16 13:45:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 13:45:08,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:45:08,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:45:08,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 13:45:08,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 13:45:08,454 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:45:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:45:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash -638048494, now seen corresponding path program 2 times [2022-10-16 13:45:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:45:08,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113839478] [2022-10-16 13:45:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:45:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:45:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:45:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:45:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:45:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113839478] [2022-10-16 13:45:09,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113839478] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:45:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334355226] [2022-10-16 13:45:09,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 13:45:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:45:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:45:09,985 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:45:10,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 13:45:10,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 13:45:10,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 13:45:10,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 81 conjunts are in the unsatisfiable core [2022-10-16 13:45:10,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:45:10,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 13:45:10,381 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 13:45:10,382 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-10-16 13:45:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:45:10,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 13:45:11,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:45:11,043 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 13:45:11,044 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 1 case distinctions, treesize of input 34 treesize of output 31 [2022-10-16 13:45:11,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:45:11,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 13:45:11,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:45:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:45:11,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:45:13,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) is different from false [2022-10-16 13:45:31,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648))))) is different from false [2022-10-16 13:45:33,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_34| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post5#1| 1) |v_ULTIMATE.start_main_~i~2#1_34|)) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |v_ULTIMATE.start_main_~i~2#1_34| 4)) v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1))))))) is different from false [2022-10-16 13:45:35,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_34| Int) (v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |v_ULTIMATE.start_main_~i~2#1_34| 4)) v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (< |v_ULTIMATE.start_main_~i~2#1_34| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))))) is different from false [2022-10-16 13:45:35,359 INFO L356 Elim1Store]: treesize reduction 101, result has 48.5 percent of original size [2022-10-16 13:45:35,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 154 [2022-10-16 13:45:35,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:45:35,417 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 5997 treesize of output 5999 [2022-10-16 13:45:35,730 INFO L356 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-10-16 13:45:35,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 76 [2022-10-16 13:45:35,838 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-10-16 13:45:35,839 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 55 treesize of output 52 [2022-10-16 13:45:35,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:45:35,977 INFO L356 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-10-16 13:45:35,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3021 treesize of output 3034 [2022-10-16 13:45:38,257 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-10-16 13:45:38,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 89 [2022-10-16 13:45:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-10-16 13:45:38,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334355226] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:45:38,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:45:38,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 58 [2022-10-16 13:45:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214324929] [2022-10-16 13:45:38,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:45:38,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-10-16 13:45:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:45:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-10-16 13:45:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2705, Unknown=18, NotChecked=436, Total=3422 [2022-10-16 13:45:38,469 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 59 states, 58 states have (on average 2.3275862068965516) internal successors, (135), 59 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:45:40,572 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) 0) (forall ((|v_ULTIMATE.start_main_~i~2#1_34| Int) (v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |v_ULTIMATE.start_main_~i~2#1_34| 4)) v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (< |v_ULTIMATE.start_main_~i~2#1_34| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= |c_ULTIMATE.start_foo_#res#1| 0) (= |c_ULTIMATE.start_foo_~i~1#1| 0)) is different from false [2022-10-16 13:45:42,576 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_main_~i~2#1_34| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post5#1| 1) |v_ULTIMATE.start_main_~i~2#1_34|)) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |v_ULTIMATE.start_main_~i~2#1_34| 4)) v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_#t~post5#1| 0)) is different from false [2022-10-16 13:45:44,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) 0 0)))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2 v_ArrVal_375))) (or (not (<= v_ArrVal_377 (select .cse0 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse0) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (not (= .cse2 0)) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) is different from false [2022-10-16 13:45:46,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4))) 0) (= |c_ULTIMATE.start_foo_#t~post2#1| 0) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) is different from false [2022-10-16 13:45:48,742 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (not (= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) 0)) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_foo_#t~post2#1| 0))) is different from false [2022-10-16 13:46:47,221 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 78 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 13:46:49,236 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse8 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (.cse2 (select .cse9 0)) (.cse1 (= (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) (and (= |c_ULTIMATE.start_bar_#t~mem1#1| 0) (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= |c_ULTIMATE.start_bar_~res~0#1| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (or (and (exists ((|ULTIMATE.start_bar_~b#1.base| Int)) (= |c_ULTIMATE.start_bar_~res~0#1| (select (select |c_#memory_int| |ULTIMATE.start_bar_~b#1.base|) 0))) .cse1) (= |c_ULTIMATE.start_bar_~res~0#1| .cse2)) (or (= |c_ULTIMATE.start_bar_~b#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse1) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse5 (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) .cse6 v_ArrVal_373))) (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| .cse5))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_375))) (or (< (select (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (not (<= v_ArrVal_377 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (not (= 0 (select .cse5 |c_ULTIMATE.start_foo_~#a~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select .cse7 .cse8) 0) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse1) (= |c_ULTIMATE.start_bar_~res~0#1| 0) (<= (select .cse7 0) 0) (= .cse8 0) (not (= .cse6 0)) (or (= |c_ULTIMATE.start_bar_#t~mem1#1| .cse2) (and (exists ((|ULTIMATE.start_bar_~b#1.base| Int)) (= |c_ULTIMATE.start_bar_#t~mem1#1| (select (select |c_#memory_int| |ULTIMATE.start_bar_~b#1.base|) 0))) .cse1)) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0) .cse1))) is different from false [2022-10-16 13:46:51,776 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (.cse5 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) (and (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse3 (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) .cse4 v_ArrVal_373))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| .cse3))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_375))) (or (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse2) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (not (<= v_ArrVal_377 (select .cse2 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (not (= 0 (select .cse3 |c_ULTIMATE.start_foo_~#a~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse5) (not (= .cse4 0)) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|) .cse5)) is different from false [2022-10-16 13:46:53,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (not (= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) 0)) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0)) (= (select .cse1 0) 0) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|))) is different from false [2022-10-16 13:48:34,776 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) (.cse2 (select .cse8 0)) (.cse1 (= (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) (and (= |c_ULTIMATE.start_bar_#t~mem1#1| 0) (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= |c_ULTIMATE.start_bar_~res~0#1| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (or (and (exists ((|ULTIMATE.start_bar_~b#1.base| Int)) (= |c_ULTIMATE.start_bar_~res~0#1| (select (select |c_#memory_int| |ULTIMATE.start_bar_~b#1.base|) 0))) .cse1) (= |c_ULTIMATE.start_bar_~res~0#1| .cse2)) (or (= |c_ULTIMATE.start_bar_~b#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse1) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse5 (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)) v_ArrVal_373))) (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| .cse5))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_375))) (or (< (select (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (not (<= v_ArrVal_377 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (not (= 0 (select .cse5 |c_ULTIMATE.start_foo_~#a~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select .cse6 .cse7) 0) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse1) (= |c_ULTIMATE.start_bar_~res~0#1| 0) (<= (select .cse6 0) 0) (= .cse7 0) (or (= |c_ULTIMATE.start_bar_#t~mem1#1| .cse2) (and (exists ((|ULTIMATE.start_bar_~b#1.base| Int)) (= |c_ULTIMATE.start_bar_#t~mem1#1| (select (select |c_#memory_int| |ULTIMATE.start_bar_~b#1.base|) 0))) .cse1)) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0) .cse1))) is different from false [2022-10-16 13:48:37,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4))) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) 0) (= |c_ULTIMATE.start_foo_#t~post2#1| 0) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-10-16 13:48:39,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_foo_#t~post2#1| 0))) is different from false [2022-10-16 13:48:41,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse4 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset|) 0))) (and (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (forall ((v_ArrVal_377 Int) (v_ArrVal_375 Int) (|ULTIMATE.start_foo_~#a~0#1.base| Int) (|v_ULTIMATE.start_foo_~i~1#1_41| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_29| Int) (v_ArrVal_380 Int)) (let ((.cse3 (store (select |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)) v_ArrVal_373))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_foo_~#a~0#1.base| .cse3))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_375))) (or (< (select (store (store (select (store .cse1 |c_ULTIMATE.start_main_~#b~0#1.base| .cse2) |v_ULTIMATE.start_foo_~#a~0#1.base_29|) 0 v_ArrVal_377) (* |v_ULTIMATE.start_foo_~i~1#1_41| 4) v_ArrVal_380) 0) 2147483648) (< |v_ULTIMATE.start_foo_~i~1#1_41| 1) (not (<= v_ArrVal_377 (select .cse2 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (not (= 0 (select .cse3 |c_ULTIMATE.start_foo_~#a~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (or (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|) .cse4)) is different from false [2022-10-16 13:48:43,921 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (not (= (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)) 0)) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|))) is different from false [2022-10-16 13:48:45,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|))) is different from false [2022-10-16 13:48:48,081 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_foo_~i~1#1|) (<= (select .cse0 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~i~1#1_41| Int)) (or (forall ((v_ArrVal_380 Int)) (< (select (store .cse0 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| (* |v_ULTIMATE.start_foo_~i~1#1_41| 4)) v_ArrVal_380) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 2147483648)) (not (<= (+ |c_ULTIMATE.start_foo_#t~post2#1| 1) |v_ULTIMATE.start_foo_~i~1#1_41|)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse0 0) 0) (<= 0 |c_ULTIMATE.start_foo_#t~post2#1|))) is different from false [2022-10-16 13:48:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:48:48,166 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2022-10-16 13:48:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 13:48:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3275862068965516) internal successors, (135), 59 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 13:48:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:48:48,168 INFO L225 Difference]: With dead ends: 143 [2022-10-16 13:48:48,168 INFO L226 Difference]: Without dead ends: 142 [2022-10-16 13:48:48,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 213.7s TimeCoverageRelationStatistics Valid=625, Invalid=4937, Unknown=64, NotChecked=3116, Total=8742 [2022-10-16 13:48:48,173 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:48:48,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 436 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 337 Invalid, 0 Unknown, 551 Unchecked, 0.3s Time] [2022-10-16 13:48:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-10-16 13:48:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2022-10-16 13:48:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1984732824427482) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 13:48:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-10-16 13:48:48,206 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 47 [2022-10-16 13:48:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:48:48,207 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-10-16 13:48:48,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3275862068965516) internal successors, (135), 59 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 13:48:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-10-16 13:48:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 13:48:48,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:48:48,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:48:48,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 13:48:48,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 13:48:48,419 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 13:48:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:48:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1695333236, now seen corresponding path program 1 times [2022-10-16 13:48:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:48:48,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211174156] [2022-10-16 13:48:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:48:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:48:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:48:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:48:50,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211174156] [2022-10-16 13:48:50,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211174156] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:48:50,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005696664] [2022-10-16 13:48:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:48:50,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:48:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:48:50,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 13:48:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 13:48:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:48:50,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 13:48:50,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:48:50,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 13:48:50,736 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 13:48:50,737 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 1 case distinctions, treesize of input 25 treesize of output 20 [2022-10-16 13:48:50,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:48:51,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 13:48:51,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:48:51,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:48:51,136 INFO L356 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2022-10-16 13:48:51,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 34 [2022-10-16 13:48:51,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:48:51,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 13:48:51,435 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 17 treesize of output 9 [2022-10-16 13:48:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:48:51,488 INFO L328 TraceCheckSpWp]: Computing backward predicates...