/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-fpi/res2of.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:46:27,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:46:27,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:46:27,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:46:27,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:46:27,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:46:27,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:46:27,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:46:27,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:46:27,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:46:27,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:46:27,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:46:27,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:46:27,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:46:27,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:46:27,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:46:27,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:46:27,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:46:27,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:46:27,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:46:27,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:46:27,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:46:27,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:46:27,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:46:27,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:46:27,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:46:27,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:46:27,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:46:27,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:46:27,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:46:27,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:46:27,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:46:27,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:46:27,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:46:27,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:46:27,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:46:27,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:46:27,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:46:27,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:46:27,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:46:27,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:46:27,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 10:46:27,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:46:27,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:46:27,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:46:27,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:46:27,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:46:27,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:46:27,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:46:27,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:46:27,527 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:46:27,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:46:27,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:46:27,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:46:27,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:46:27,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:46:27,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:46:27,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:46:27,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:46:27,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:46:27,529 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:46:27,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:46:27,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:46:27,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:46:27,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:46:27,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:46:27,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:46:27,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:46:27,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:46:27,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:46:27,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:46:27,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:46:27,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:46:27,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:46:27,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:46:27,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 10:46:27,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:46:28,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:46:28,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:46:28,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:46:28,006 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:46:28,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2of.c [2022-10-16 10:46:28,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766c7c9f1/531696cbe9f3415ca64ee967b3347226/FLAGe4080006a [2022-10-16 10:46:28,747 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:46:28,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2of.c [2022-10-16 10:46:28,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766c7c9f1/531696cbe9f3415ca64ee967b3347226/FLAGe4080006a [2022-10-16 10:46:29,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766c7c9f1/531696cbe9f3415ca64ee967b3347226 [2022-10-16 10:46:29,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:46:29,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:46:29,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:46:29,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:46:29,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:46:29,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3e7545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29, skipping insertion in model container [2022-10-16 10:46:29,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:46:29,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:46:29,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2of.c[589,602] [2022-10-16 10:46:29,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:46:29,452 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:46:29,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2of.c[589,602] [2022-10-16 10:46:29,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:46:29,509 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:46:29,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29 WrapperNode [2022-10-16 10:46:29,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:46:29,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:46:29,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:46:29,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:46:29,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,567 INFO L138 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2022-10-16 10:46:29,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:46:29,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:46:29,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:46:29,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:46:29,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,606 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:46:29,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:46:29,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:46:29,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:46:29,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:46:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:29,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 10:46:29,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 10:46:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:46:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:46:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:46:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:46:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:46:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:46:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:46:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:46:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:46:29,826 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:46:29,829 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:46:30,232 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:46:30,265 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:46:30,266 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-16 10:46:30,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:30 BoogieIcfgContainer [2022-10-16 10:46:30,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:46:30,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:46:30,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:46:30,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:46:30,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:46:29" (1/3) ... [2022-10-16 10:46:30,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d19c3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:30, skipping insertion in model container [2022-10-16 10:46:30,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (2/3) ... [2022-10-16 10:46:30,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d19c3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:30, skipping insertion in model container [2022-10-16 10:46:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:30" (3/3) ... [2022-10-16 10:46:30,285 INFO L112 eAbstractionObserver]: Analyzing ICFG res2of.c [2022-10-16 10:46:30,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:46:30,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-16 10:46:30,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:46:30,456 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;@56a541cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:46:30,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-16 10:46:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:46:30,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:30,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:30,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:46:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:30,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651704773] [2022-10-16 10:46:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:30,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651704773] [2022-10-16 10:46:30,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651704773] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:30,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:30,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:46:30,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700094666] [2022-10-16 10:46:30,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:46:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:46:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:46:30,837 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:30,865 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2022-10-16 10:46:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:46:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:46:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:30,879 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:46:30,879 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 10:46:30,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:46:30,889 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:30,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 10:46:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-16 10:46:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-10-16 10:46:30,938 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 8 [2022-10-16 10:46:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:30,939 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-10-16 10:46:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-10-16 10:46:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:46:30,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:30,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:30,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:46:30,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:46:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:30,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316616058] [2022-10-16 10:46:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316616058] [2022-10-16 10:46:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316616058] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:31,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:31,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402229730] [2022-10-16 10:46:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:31,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:31,228 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:31,377 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-10-16 10:46:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:31,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:46:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:31,387 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:46:31,387 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 10:46:31,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:46:31,389 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:31,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 130 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 10:46:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 67. [2022-10-16 10:46:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-10-16 10:46:31,417 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2022-10-16 10:46:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:31,421 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-10-16 10:46:31,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-10-16 10:46:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:46:31,422 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:31,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:31,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:46:31,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 678258679, now seen corresponding path program 1 times [2022-10-16 10:46:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:31,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731166381] [2022-10-16 10:46:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:31,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731166381] [2022-10-16 10:46:31,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731166381] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:31,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:31,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:46:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791620505] [2022-10-16 10:46:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:31,575 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:31,774 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-10-16 10:46:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 10:46:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:31,780 INFO L225 Difference]: With dead ends: 160 [2022-10-16 10:46:31,781 INFO L226 Difference]: Without dead ends: 107 [2022-10-16 10:46:31,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:31,784 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:31,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-16 10:46:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2022-10-16 10:46:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-10-16 10:46:31,809 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 10 [2022-10-16 10:46:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:31,813 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-10-16 10:46:31,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-10-16 10:46:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:46:31,814 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:31,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:31,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:46:31,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:46:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:31,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076679876] [2022-10-16 10:46:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:31,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076679876] [2022-10-16 10:46:31,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076679876] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694927285] [2022-10-16 10:46:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:31,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:31,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 10:46:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:32,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:32,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:32,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:32,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694927285] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:32,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:32,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:46:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629417541] [2022-10-16 10:46:32,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:32,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:46:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:32,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:46:32,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:46:32,271 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:32,525 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-10-16 10:46:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 10:46:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:32,529 INFO L225 Difference]: With dead ends: 126 [2022-10-16 10:46:32,530 INFO L226 Difference]: Without dead ends: 125 [2022-10-16 10:46:32,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:46:32,532 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 105 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:32,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 198 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-16 10:46:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 81. [2022-10-16 10:46:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.467741935483871) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-10-16 10:46:32,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 12 [2022-10-16 10:46:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:32,547 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-10-16 10:46:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-10-16 10:46:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:46:32,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:32,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:32,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:32,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:46:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:32,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322308447] [2022-10-16 10:46:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:32,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322308447] [2022-10-16 10:46:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322308447] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870868782] [2022-10-16 10:46:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:32,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:32,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:33,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 10:46:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:33,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:33,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:33,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870868782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:33,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:33,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:46:33,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714101064] [2022-10-16 10:46:33,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:33,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:46:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:46:33,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:33,124 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:33,220 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-10-16 10:46:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:46:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 10:46:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:33,222 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:46:33,222 INFO L226 Difference]: Without dead ends: 117 [2022-10-16 10:46:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:46:33,224 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:33,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 161 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-16 10:46:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2022-10-16 10:46:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 79 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 10:46:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-10-16 10:46:33,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 13 [2022-10-16 10:46:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:33,236 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-10-16 10:46:33,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-10-16 10:46:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:46:33,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:33,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:33,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:33,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -825622541, now seen corresponding path program 1 times [2022-10-16 10:46:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382925370] [2022-10-16 10:46:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382925370] [2022-10-16 10:46:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382925370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:33,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:33,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710484848] [2022-10-16 10:46:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:33,524 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:33,594 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-10-16 10:46:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:46:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:33,595 INFO L225 Difference]: With dead ends: 117 [2022-10-16 10:46:33,596 INFO L226 Difference]: Without dead ends: 115 [2022-10-16 10:46:33,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:46:33,597 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:33,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-16 10:46:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2022-10-16 10:46:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-10-16 10:46:33,607 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 14 [2022-10-16 10:46:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:33,608 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-10-16 10:46:33,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-10-16 10:46:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 10:46:33,609 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:33,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:33,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:46:33,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1496738415, now seen corresponding path program 1 times [2022-10-16 10:46:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:33,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948545379] [2022-10-16 10:46:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948545379] [2022-10-16 10:46:33,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948545379] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:33,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044287592] [2022-10-16 10:46:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:33,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:33,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 10:46:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:33,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:33,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:34,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044287592] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:34,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:34,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:46:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389553983] [2022-10-16 10:46:34,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:34,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:34,011 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:34,400 INFO L93 Difference]: Finished difference Result 258 states and 277 transitions. [2022-10-16 10:46:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:46:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 10:46:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:34,402 INFO L225 Difference]: With dead ends: 258 [2022-10-16 10:46:34,402 INFO L226 Difference]: Without dead ends: 203 [2022-10-16 10:46:34,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:34,404 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 300 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:34,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 417 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-16 10:46:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 121. [2022-10-16 10:46:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-10-16 10:46:34,417 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2022-10-16 10:46:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:34,417 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-10-16 10:46:34,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-10-16 10:46:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 10:46:34,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:34,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:34,458 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 10:46:34,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:34,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -450019723, now seen corresponding path program 1 times [2022-10-16 10:46:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:34,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776776162] [2022-10-16 10:46:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:34,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776776162] [2022-10-16 10:46:34,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776776162] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:34,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:34,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058616869] [2022-10-16 10:46:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:34,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:34,704 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:34,766 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2022-10-16 10:46:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:34,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-10-16 10:46:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:34,768 INFO L225 Difference]: With dead ends: 172 [2022-10-16 10:46:34,768 INFO L226 Difference]: Without dead ends: 170 [2022-10-16 10:46:34,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:46:34,770 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:34,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-16 10:46:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2022-10-16 10:46:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 126 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-10-16 10:46:34,780 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 20 [2022-10-16 10:46:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:34,781 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-10-16 10:46:34,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-10-16 10:46:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:46:34,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:34,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:34,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:46:34,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1488947009, now seen corresponding path program 1 times [2022-10-16 10:46:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132150620] [2022-10-16 10:46:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:34,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:34,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132150620] [2022-10-16 10:46:34,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132150620] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:34,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592839429] [2022-10-16 10:46:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:34,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:34,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 10:46:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:34,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:34,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:34,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592839429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:34,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:34,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:46:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005982164] [2022-10-16 10:46:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:46:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:46:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:34,982 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:35,083 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-10-16 10:46:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:46:35,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:46:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:35,086 INFO L225 Difference]: With dead ends: 170 [2022-10-16 10:46:35,086 INFO L226 Difference]: Without dead ends: 169 [2022-10-16 10:46:35,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:46:35,090 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:35,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-16 10:46:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2022-10-16 10:46:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 125 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2022-10-16 10:46:35,101 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 23 [2022-10-16 10:46:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:35,102 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2022-10-16 10:46:35,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2022-10-16 10:46:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:46:35,110 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:35,110 INFO L195 NwaCegarLoop]: trace histogram [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 10:46:35,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:35,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash -151319439, now seen corresponding path program 1 times [2022-10-16 10:46:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:35,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593904990] [2022-10-16 10:46:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:35,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593904990] [2022-10-16 10:46:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593904990] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:35,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728538588] [2022-10-16 10:46:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:35,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:35,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:35,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 10:46:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:35,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:35,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:35,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:35,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728538588] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:35,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:35,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:46:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369832770] [2022-10-16 10:46:35,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:35,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:35,727 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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 10:46:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:36,078 INFO L93 Difference]: Finished difference Result 331 states and 406 transitions. [2022-10-16 10:46:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:46:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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) Word has length 24 [2022-10-16 10:46:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:36,080 INFO L225 Difference]: With dead ends: 331 [2022-10-16 10:46:36,081 INFO L226 Difference]: Without dead ends: 287 [2022-10-16 10:46:36,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:36,082 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 249 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:36,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 423 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-10-16 10:46:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 138. [2022-10-16 10:46:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.371900826446281) internal successors, (166), 137 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-10-16 10:46:36,093 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 24 [2022-10-16 10:46:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-10-16 10:46:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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 10:46:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-10-16 10:46:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:46:36,094 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:36,095 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:36,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:36,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 10:46:36,311 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:46:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945719240] [2022-10-16 10:46:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:36,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945719240] [2022-10-16 10:46:36,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945719240] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:36,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068372081] [2022-10-16 10:46:36,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:36,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:36,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:36,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:36,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 10:46:36,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:46:36,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:36,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:36,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:46:36,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:46:36,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068372081] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:36,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:36,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:46:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883531929] [2022-10-16 10:46:36,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:36,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:36,726 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:36,976 INFO L93 Difference]: Finished difference Result 191 states and 234 transitions. [2022-10-16 10:46:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:36,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:46:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:36,979 INFO L225 Difference]: With dead ends: 191 [2022-10-16 10:46:36,979 INFO L226 Difference]: Without dead ends: 190 [2022-10-16 10:46:36,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:46:36,981 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 273 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:36,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 137 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-16 10:46:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 127. [2022-10-16 10:46:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 126 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-10-16 10:46:36,991 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 24 [2022-10-16 10:46:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:36,991 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-10-16 10:46:36,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-10-16 10:46:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:46:36,992 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:36,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:37,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:37,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:37,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -395986665, now seen corresponding path program 1 times [2022-10-16 10:46:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:37,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349164614] [2022-10-16 10:46:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:38,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349164614] [2022-10-16 10:46:38,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349164614] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:38,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906894494] [2022-10-16 10:46:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:38,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:38,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:38,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 10:46:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:46:38,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:38,410 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:46:38,411 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 36 treesize of output 30 [2022-10-16 10:46:38,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:46:38,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:38,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:46:38,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:38,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:46:38,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 10:46:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:38,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:39,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:46:39,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:46:39,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (<= v_ArrVal_422 1)) (< (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_422)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808))) is different from false [2022-10-16 10:46:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-16 10:46:39,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906894494] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:39,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:39,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-10-16 10:46:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828058612] [2022-10-16 10:46:39,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:39,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 10:46:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 10:46:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=244, Unknown=3, NotChecked=102, Total=420 [2022-10-16 10:46:39,282 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:39,926 INFO L93 Difference]: Finished difference Result 159 states and 195 transitions. [2022-10-16 10:46:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:46:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:46:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:39,927 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:46:39,928 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 10:46:39,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=459, Unknown=3, NotChecked=144, Total=756 [2022-10-16 10:46:39,929 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 146 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 459 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 218 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-10-16 10:46:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 10:46:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-10-16 10:46:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 130 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 10:46:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2022-10-16 10:46:39,946 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 25 [2022-10-16 10:46:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:39,947 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2022-10-16 10:46:39,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-10-16 10:46:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:46:39,948 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:39,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:39,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:40,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:40,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1201818393, now seen corresponding path program 2 times [2022-10-16 10:46:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55611496] [2022-10-16 10:46:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:40,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55611496] [2022-10-16 10:46:40,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55611496] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:40,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763355663] [2022-10-16 10:46:40,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:40,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:40,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:40,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:40,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 10:46:40,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:46:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:40,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:40,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:40,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763355663] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:40,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:40,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:46:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580474595] [2022-10-16 10:46:40,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:40,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:40,527 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:40,982 INFO L93 Difference]: Finished difference Result 397 states and 489 transitions. [2022-10-16 10:46:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:46:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 10:46:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:40,985 INFO L225 Difference]: With dead ends: 397 [2022-10-16 10:46:40,985 INFO L226 Difference]: Without dead ends: 310 [2022-10-16 10:46:40,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:46:40,987 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 510 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:40,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 341 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-10-16 10:46:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 142. [2022-10-16 10:46:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:46:41,005 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 26 [2022-10-16 10:46:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:41,005 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:46:41,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:46:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:46:41,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:41,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:41,052 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 10:46:41,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:46:41,220 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1436534393, now seen corresponding path program 1 times [2022-10-16 10:46:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:41,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906959202] [2022-10-16 10:46:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:46:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906959202] [2022-10-16 10:46:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906959202] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:41,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:41,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634376952] [2022-10-16 10:46:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:41,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:41,283 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:41,356 INFO L93 Difference]: Finished difference Result 179 states and 217 transitions. [2022-10-16 10:46:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:46:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:41,357 INFO L225 Difference]: With dead ends: 179 [2022-10-16 10:46:41,358 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 10:46:41,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:46:41,359 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:41,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 10:46:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 148. [2022-10-16 10:46:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 147 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2022-10-16 10:46:41,376 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 28 [2022-10-16 10:46:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:41,376 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2022-10-16 10:46:41,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-10-16 10:46:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:46:41,377 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:41,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:41,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:46:41,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1409249937, now seen corresponding path program 1 times [2022-10-16 10:46:41,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:41,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939135510] [2022-10-16 10:46:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939135510] [2022-10-16 10:46:41,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939135510] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:41,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110606617] [2022-10-16 10:46:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:41,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:41,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 10:46:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:41,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:41,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:41,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:41,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110606617] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:41,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:41,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:46:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316886023] [2022-10-16 10:46:41,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:41,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:41,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:41,732 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:42,143 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2022-10-16 10:46:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 10:46:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:42,145 INFO L225 Difference]: With dead ends: 293 [2022-10-16 10:46:42,145 INFO L226 Difference]: Without dead ends: 239 [2022-10-16 10:46:42,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:42,147 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 221 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:42,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 586 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:46:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-16 10:46:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 148. [2022-10-16 10:46:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2022-10-16 10:46:42,169 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 29 [2022-10-16 10:46:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:42,170 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2022-10-16 10:46:42,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2022-10-16 10:46:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 10:46:42,172 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:42,172 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:42,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:42,385 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 10:46:42,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash 742079389, now seen corresponding path program 1 times [2022-10-16 10:46:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022507277] [2022-10-16 10:46:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022507277] [2022-10-16 10:46:42,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022507277] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004088510] [2022-10-16 10:46:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:42,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:42,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:42,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:42,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:46:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:42,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:42,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004088510] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:42,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:42,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:46:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496779031] [2022-10-16 10:46:42,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:42,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:42,774 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:43,045 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2022-10-16 10:46:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:46:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 10:46:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:43,047 INFO L225 Difference]: With dead ends: 260 [2022-10-16 10:46:43,047 INFO L226 Difference]: Without dead ends: 227 [2022-10-16 10:46:43,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:46:43,049 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 192 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:43,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 359 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-16 10:46:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-10-16 10:46:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 155 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2022-10-16 10:46:43,067 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 31 [2022-10-16 10:46:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:43,067 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2022-10-16 10:46:43,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2022-10-16 10:46:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:46:43,068 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:43,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:43,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:43,282 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 10:46:43,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 173677741, now seen corresponding path program 1 times [2022-10-16 10:46:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685638840] [2022-10-16 10:46:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:44,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685638840] [2022-10-16 10:46:44,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685638840] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:44,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031665689] [2022-10-16 10:46:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:44,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:44,696 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:44,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:46:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:44,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:46:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:44,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:46:44,828 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:46:44,829 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 40 treesize of output 34 [2022-10-16 10:46:44,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:45,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:46:45,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-10-16 10:46:45,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-10-16 10:46:46,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2022-10-16 10:46:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:46,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:47,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031665689] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:47,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:47,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-10-16 10:46:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340425268] [2022-10-16 10:46:47,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:47,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-16 10:46:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-16 10:46:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 10:46:47,984 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:49,151 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2022-10-16 10:46:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:46:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:46:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:49,152 INFO L225 Difference]: With dead ends: 162 [2022-10-16 10:46:49,153 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:46:49,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2022-10-16 10:46:49,155 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:49,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 688 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 161 Invalid, 0 Unknown, 337 Unchecked, 0.2s Time] [2022-10-16 10:46:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:46:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:46:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 158 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2022-10-16 10:46:49,173 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 33 [2022-10-16 10:46:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:49,173 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2022-10-16 10:46:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2022-10-16 10:46:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:46:49,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:49,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:49,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:46:49,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1206190229, now seen corresponding path program 2 times [2022-10-16 10:46:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:49,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717872691] [2022-10-16 10:46:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:49,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717872691] [2022-10-16 10:46:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717872691] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:49,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140955165] [2022-10-16 10:46:49,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:49,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:49,486 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:49,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:46:49,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:46:49,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:49,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:49,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:49,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:49,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140955165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:49,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:49,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-10-16 10:46:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195124859] [2022-10-16 10:46:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:49,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:49,606 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:49,672 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2022-10-16 10:46:49,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:49,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:46:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:49,674 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:46:49,674 INFO L226 Difference]: Without dead ends: 158 [2022-10-16 10:46:49,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:46:49,675 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:49,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-10-16 10:46:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-10-16 10:46:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-10-16 10:46:49,695 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 33 [2022-10-16 10:46:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:49,695 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-10-16 10:46:49,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-10-16 10:46:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:46:49,696 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:49,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:49,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:46:49,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:46:49,910 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:49,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1089042807, now seen corresponding path program 1 times [2022-10-16 10:46:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:49,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154804016] [2022-10-16 10:46:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154804016] [2022-10-16 10:46:51,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154804016] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210762503] [2022-10-16 10:46:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:51,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:51,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:46:51,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:46:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:51,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:46:51,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:51,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 10:46:51,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:46:51,518 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 10:46:51,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:51,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:51,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:46:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:51,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:56,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809)))) is different from false [2022-10-16 10:46:58,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-10-16 10:46:58,782 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 754 treesize of output 738 [2022-10-16 10:47:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:47:00,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210762503] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:00,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:00,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-10-16 10:47:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070787255] [2022-10-16 10:47:00,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:00,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:47:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:47:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=560, Unknown=3, NotChecked=102, Total=812 [2022-10-16 10:47:00,647 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:02,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:04,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:06,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:07,203 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-10-16 10:47:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:47:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:47:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:07,206 INFO L225 Difference]: With dead ends: 207 [2022-10-16 10:47:07,206 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:47:07,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=224, Invalid=912, Unknown=6, NotChecked=340, Total=1482 [2022-10-16 10:47:07,208 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:07,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 586 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 154 Unchecked, 0.3s Time] [2022-10-16 10:47:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:47:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2022-10-16 10:47:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.2689655172413794) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2022-10-16 10:47:07,228 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 34 [2022-10-16 10:47:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:07,228 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2022-10-16 10:47:07,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2022-10-16 10:47:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:47:07,229 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:07,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:07,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:07,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:07,442 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1401878407, now seen corresponding path program 1 times [2022-10-16 10:47:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28570153] [2022-10-16 10:47:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:47:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28570153] [2022-10-16 10:47:07,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28570153] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285097826] [2022-10-16 10:47:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:07,514 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:07,589 INFO L93 Difference]: Finished difference Result 188 states and 221 transitions. [2022-10-16 10:47:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:47:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:07,591 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:47:07,591 INFO L226 Difference]: Without dead ends: 186 [2022-10-16 10:47:07,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:47:07,593 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:07,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 125 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:47:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-10-16 10:47:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2022-10-16 10:47:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2022-10-16 10:47:07,627 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 36 [2022-10-16 10:47:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:07,627 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2022-10-16 10:47:07,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-10-16 10:47:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:47:07,628 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:07,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:07,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 10:47:07,629 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1916801253, now seen corresponding path program 2 times [2022-10-16 10:47:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924533064] [2022-10-16 10:47:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:07,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924533064] [2022-10-16 10:47:07,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924533064] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:07,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229116352] [2022-10-16 10:47:07,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:07,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:07,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:47:07,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:47:07,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:07,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:47:07,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:47:07,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:47:08,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229116352] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:08,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:08,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:47:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495280042] [2022-10-16 10:47:08,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:08,026 INFO L87 Difference]: Start difference. First operand 169 states and 198 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 10:47:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:08,460 INFO L93 Difference]: Finished difference Result 300 states and 338 transitions. [2022-10-16 10:47:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 10:47:08,461 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 36 [2022-10-16 10:47:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:08,463 INFO L225 Difference]: With dead ends: 300 [2022-10-16 10:47:08,463 INFO L226 Difference]: Without dead ends: 250 [2022-10-16 10:47:08,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:47:08,464 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 320 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:08,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 307 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-10-16 10:47:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 164. [2022-10-16 10:47:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 151 states have (on average 1.2649006622516556) internal successors, (191), 163 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2022-10-16 10:47:08,485 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 36 [2022-10-16 10:47:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:08,486 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2022-10-16 10:47:08,486 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 10:47:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2022-10-16 10:47:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 10:47:08,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:08,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:08,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:08,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:08,702 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash 902500083, now seen corresponding path program 1 times [2022-10-16 10:47:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:08,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557199435] [2022-10-16 10:47:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:08,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557199435] [2022-10-16 10:47:08,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557199435] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878794872] [2022-10-16 10:47:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:08,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:08,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:47:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:08,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:08,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:09,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:09,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878794872] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:09,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:09,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:47:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129778434] [2022-10-16 10:47:09,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:09,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:09,147 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:09,429 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2022-10-16 10:47:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:47:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-16 10:47:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:09,434 INFO L225 Difference]: With dead ends: 227 [2022-10-16 10:47:09,434 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:47:09,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:47:09,437 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 186 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:09,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 274 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:47:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 168. [2022-10-16 10:47:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.2580645161290323) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2022-10-16 10:47:09,467 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 39 [2022-10-16 10:47:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:09,468 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2022-10-16 10:47:09,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2022-10-16 10:47:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 10:47:09,469 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:09,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:09,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:09,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:09,683 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -525159387, now seen corresponding path program 2 times [2022-10-16 10:47:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576130066] [2022-10-16 10:47:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:09,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576130066] [2022-10-16 10:47:09,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576130066] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:09,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423723594] [2022-10-16 10:47:09,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:09,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:09,905 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:09,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:47:10,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:47:10,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:10,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:10,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:10,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:10,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423723594] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:10,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:10,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:47:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495193517] [2022-10-16 10:47:10,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:10,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:10,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:10,185 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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 10:47:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:10,556 INFO L93 Difference]: Finished difference Result 254 states and 287 transitions. [2022-10-16 10:47:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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) Word has length 39 [2022-10-16 10:47:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:10,558 INFO L225 Difference]: With dead ends: 254 [2022-10-16 10:47:10,558 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 10:47:10,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:47:10,559 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 232 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:10,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 447 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 10:47:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 168. [2022-10-16 10:47:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 167 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2022-10-16 10:47:10,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 39 [2022-10-16 10:47:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:10,581 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2022-10-16 10:47:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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 10:47:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2022-10-16 10:47:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:47:10,582 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:10,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:10,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-16 10:47:10,796 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -280857277, now seen corresponding path program 1 times [2022-10-16 10:47:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033332588] [2022-10-16 10:47:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:12,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033332588] [2022-10-16 10:47:12,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033332588] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:12,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567437941] [2022-10-16 10:47:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:12,722 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:12,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:47:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:12,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 10:47:12,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:12,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,858 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:12,859 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 41 treesize of output 35 [2022-10-16 10:47:12,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:47:12,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:47:13,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:13,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:47:13,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:13,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:13,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-10-16 10:47:14,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:14,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:14,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-10-16 10:47:14,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:14,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-10-16 10:47:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:15,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:15,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:47:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:15,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:21,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567437941] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:21,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:21,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-10-16 10:47:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622159537] [2022-10-16 10:47:21,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:21,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:47:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:47:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1670, Unknown=1, NotChecked=0, Total=1892 [2022-10-16 10:47:21,071 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:24,009 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-10-16 10:47:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:47:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:47:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:24,010 INFO L225 Difference]: With dead ends: 174 [2022-10-16 10:47:24,010 INFO L226 Difference]: Without dead ends: 173 [2022-10-16 10:47:24,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=471, Invalid=2834, Unknown=1, NotChecked=0, Total=3306 [2022-10-16 10:47:24,012 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 103 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:24,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 752 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 354 Unchecked, 0.3s Time] [2022-10-16 10:47:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-10-16 10:47:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-10-16 10:47:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 158 states have (on average 1.240506329113924) internal successors, (196), 170 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2022-10-16 10:47:24,035 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 41 [2022-10-16 10:47:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:24,035 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2022-10-16 10:47:24,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-10-16 10:47:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:47:24,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:24,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:24,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:24,250 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash -116640841, now seen corresponding path program 1 times [2022-10-16 10:47:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:24,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9488004] [2022-10-16 10:47:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9488004] [2022-10-16 10:47:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9488004] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187520640] [2022-10-16 10:47:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:26,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:47:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:26,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:47:26,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:26,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:47:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:26,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:47:26,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:26,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:47:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:26,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:47:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:27,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:27,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:27,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 10:47:27,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))))) is different from false [2022-10-16 10:47:27,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:27,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-10-16 10:47:27,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:27,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2022-10-16 10:47:27,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:27,355 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 35 treesize of output 35 [2022-10-16 10:47:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-10-16 10:47:28,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187520640] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:28,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:28,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 28 [2022-10-16 10:47:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315717924] [2022-10-16 10:47:28,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:28,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:47:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:47:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=630, Unknown=2, NotChecked=52, Total=812 [2022-10-16 10:47:28,574 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:30,439 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-10-16 10:47:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 10:47:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-16 10:47:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:30,441 INFO L225 Difference]: With dead ends: 248 [2022-10-16 10:47:30,442 INFO L226 Difference]: Without dead ends: 246 [2022-10-16 10:47:30,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=431, Invalid=1827, Unknown=2, NotChecked=92, Total=2352 [2022-10-16 10:47:30,445 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 454 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:30,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 348 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 290 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2022-10-16 10:47:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-16 10:47:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 186. [2022-10-16 10:47:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 173 states have (on average 1.254335260115607) internal successors, (217), 185 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 217 transitions. [2022-10-16 10:47:30,483 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 217 transitions. Word has length 42 [2022-10-16 10:47:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:30,483 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 217 transitions. [2022-10-16 10:47:30,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 217 transitions. [2022-10-16 10:47:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:47:30,484 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:30,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:30,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:30,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:30,696 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1182889, now seen corresponding path program 3 times [2022-10-16 10:47:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808833455] [2022-10-16 10:47:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808833455] [2022-10-16 10:47:32,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808833455] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458890218] [2022-10-16 10:47:32,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:47:32,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:32,177 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:32,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:47:32,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:47:32,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:32,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:47:32,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:32,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:47:32,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:32,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:32,338 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:32,339 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 32 treesize of output 26 [2022-10-16 10:47:32,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:47:32,723 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:47:32,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-16 10:47:33,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:33,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:33,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:33,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:33,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:33,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:33,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:33,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:34,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:47:34,219 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:47:34,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:47:34,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:47:34,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:34,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2022-10-16 10:47:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:34,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:35,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) is different from false [2022-10-16 10:47:35,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) is different from false [2022-10-16 10:47:35,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_151| 1)) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:35,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |c_ULTIMATE.start_main_#t~post8#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:35,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:35,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1170 1)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176))))) is different from false [2022-10-16 10:47:36,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ v_ArrVal_1176 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) is different from false [2022-10-16 10:47:36,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (v_ArrVal_1167 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1167) (+ (* |v_ULTIMATE.start_main_~i~0#1_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1167 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2022-10-16 10:47:36,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458890218] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:36,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:36,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 47 [2022-10-16 10:47:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355991634] [2022-10-16 10:47:36,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:36,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-16 10:47:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-16 10:47:36,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1422, Unknown=10, NotChecked=664, Total=2256 [2022-10-16 10:47:36,306 INFO L87 Difference]: Start difference. First operand 186 states and 217 transitions. Second operand has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:37,599 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= .cse0 0) (<= .cse1 1) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ v_ArrVal_1176 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:47:41,708 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0))))))) is different from false [2022-10-16 10:47:41,850 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) is different from false [2022-10-16 10:47:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:44,185 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2022-10-16 10:47:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:47:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-10-16 10:47:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:44,189 INFO L225 Difference]: With dead ends: 227 [2022-10-16 10:47:44,189 INFO L226 Difference]: Without dead ends: 226 [2022-10-16 10:47:44,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=332, Invalid=2889, Unknown=15, NotChecked=1320, Total=4556 [2022-10-16 10:47:44,191 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 746 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:44,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 819 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 293 Invalid, 0 Unknown, 746 Unchecked, 0.2s Time] [2022-10-16 10:47:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-10-16 10:47:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-10-16 10:47:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.244131455399061) internal successors, (265), 225 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2022-10-16 10:47:44,221 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 43 [2022-10-16 10:47:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:44,222 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2022-10-16 10:47:44,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2022-10-16 10:47:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:47:44,223 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:44,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:44,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-10-16 10:47:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:44,436 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -422693511, now seen corresponding path program 1 times [2022-10-16 10:47:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621618717] [2022-10-16 10:47:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 10:47:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:44,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621618717] [2022-10-16 10:47:44,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621618717] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:44,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:44,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152598797] [2022-10-16 10:47:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:44,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:44,499 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:44,597 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2022-10-16 10:47:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 10:47:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:44,600 INFO L225 Difference]: With dead ends: 237 [2022-10-16 10:47:44,600 INFO L226 Difference]: Without dead ends: 235 [2022-10-16 10:47:44,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:47:44,601 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:44,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-10-16 10:47:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2022-10-16 10:47:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 231 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 271 transitions. [2022-10-16 10:47:44,638 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 271 transitions. Word has length 44 [2022-10-16 10:47:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:44,638 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 271 transitions. [2022-10-16 10:47:44,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 271 transitions. [2022-10-16 10:47:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:47:44,639 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:44,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:44,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 10:47:44,640 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash 36669669, now seen corresponding path program 1 times [2022-10-16 10:47:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:44,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372752682] [2022-10-16 10:47:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372752682] [2022-10-16 10:47:45,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372752682] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715626138] [2022-10-16 10:47:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:45,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:45,347 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:47:45,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:47:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:45,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:47:45,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:45,479 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:45,479 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 88 treesize of output 82 [2022-10-16 10:47:45,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:47:45,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:45,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:45,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:45,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:46,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:47:46,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:47:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:46,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:53,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1276 (Array Int Int))) (or (< (+ 9223372036854775808 v_ArrVal_1277) 0) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1276))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 9223372036854775809 v_ArrVal_1277)))) is different from false [2022-10-16 10:47:53,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (or (< 0 (+ 9223372036854775809 v_ArrVal_1277 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1276))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< (+ 9223372036854775808 v_ArrVal_1277) 0))) is different from false [2022-10-16 10:47:53,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:53,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-10-16 10:47:53,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:53,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3498 treesize of output 3448 [2022-10-16 10:47:53,252 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 3574 treesize of output 3462 [2022-10-16 10:47:53,302 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 4614 treesize of output 4198 [2022-10-16 10:47:53,476 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 454 treesize of output 422 [2022-10-16 10:47:57,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:57,852 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 2447 treesize of output 2379 [2022-10-16 10:48:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 15 not checked. [2022-10-16 10:48:02,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715626138] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:02,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:02,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-10-16 10:48:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242523596] [2022-10-16 10:48:02,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:02,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:48:02,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:48:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=819, Unknown=4, NotChecked=118, Total=1056 [2022-10-16 10:48:02,082 INFO L87 Difference]: Start difference. First operand 232 states and 271 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:03,301 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2022-10-16 10:48:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:48:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 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 10:48:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:03,304 INFO L225 Difference]: With dead ends: 261 [2022-10-16 10:48:03,304 INFO L226 Difference]: Without dead ends: 260 [2022-10-16 10:48:03,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=218, Invalid=1346, Unknown=4, NotChecked=154, Total=1722 [2022-10-16 10:48:03,305 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 103 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:03,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1161 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 765 Invalid, 0 Unknown, 286 Unchecked, 0.6s Time] [2022-10-16 10:48:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-10-16 10:48:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2022-10-16 10:48:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 219 states have (on average 1.2328767123287672) internal successors, (270), 231 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 270 transitions. [2022-10-16 10:48:03,341 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 270 transitions. Word has length 44 [2022-10-16 10:48:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:03,341 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 270 transitions. [2022-10-16 10:48:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2022-10-16 10:48:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:48:03,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:03,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:03,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:03,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 10:48:03,548 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1136712377, now seen corresponding path program 2 times [2022-10-16 10:48:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386603693] [2022-10-16 10:48:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:03,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386603693] [2022-10-16 10:48:03,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386603693] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:03,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846973819] [2022-10-16 10:48:03,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:03,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:03,692 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:03,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 10:48:03,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:03,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:03,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:48:03,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:03,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:04,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846973819] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:04,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:04,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:48:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382068441] [2022-10-16 10:48:04,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:04,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:48:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:48:04,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:48:04,053 INFO L87 Difference]: Start difference. First operand 232 states and 270 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:04,468 INFO L93 Difference]: Finished difference Result 313 states and 360 transitions. [2022-10-16 10:48:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:48:04,468 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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 45 [2022-10-16 10:48:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:04,470 INFO L225 Difference]: With dead ends: 313 [2022-10-16 10:48:04,470 INFO L226 Difference]: Without dead ends: 250 [2022-10-16 10:48:04,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:48:04,472 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 276 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:04,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 433 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-10-16 10:48:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2022-10-16 10:48:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 211 states have (on average 1.2180094786729858) internal successors, (257), 223 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2022-10-16 10:48:04,505 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 257 transitions. Word has length 45 [2022-10-16 10:48:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:04,506 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 257 transitions. [2022-10-16 10:48:04,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 257 transitions. [2022-10-16 10:48:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-16 10:48:04,507 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:04,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:04,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 10:48:04,708 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 879817127, now seen corresponding path program 1 times [2022-10-16 10:48:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:04,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557714568] [2022-10-16 10:48:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557714568] [2022-10-16 10:48:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557714568] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350724110] [2022-10-16 10:48:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:04,793 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:04,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 10:48:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:04,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:04,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:04,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:04,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350724110] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:04,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:04,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:48:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839285208] [2022-10-16 10:48:04,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:05,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:48:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:48:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:48:05,003 INFO L87 Difference]: Start difference. First operand 224 states and 257 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:05,215 INFO L93 Difference]: Finished difference Result 268 states and 310 transitions. [2022-10-16 10:48:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:48:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-16 10:48:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:05,219 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:48:05,219 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:48:05,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:48:05,221 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 77 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:05,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 198 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:48:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 249. [2022-10-16 10:48:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 236 states have (on average 1.2542372881355932) internal successors, (296), 248 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2022-10-16 10:48:05,260 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 46 [2022-10-16 10:48:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:05,260 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2022-10-16 10:48:05,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2022-10-16 10:48:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:48:05,261 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:05,261 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:05,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:05,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:05,475 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 381884233, now seen corresponding path program 1 times [2022-10-16 10:48:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:05,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419149501] [2022-10-16 10:48:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:05,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419149501] [2022-10-16 10:48:05,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419149501] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:05,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950984261] [2022-10-16 10:48:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:05,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:05,635 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:05,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 10:48:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:05,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:48:05,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:05,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:05,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950984261] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:05,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:05,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:48:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597633299] [2022-10-16 10:48:05,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:05,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:48:05,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:05,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:48:05,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:48:05,992 INFO L87 Difference]: Start difference. First operand 249 states and 296 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:06,263 INFO L93 Difference]: Finished difference Result 267 states and 311 transitions. [2022-10-16 10:48:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:48:06,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 10:48:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:06,265 INFO L225 Difference]: With dead ends: 267 [2022-10-16 10:48:06,265 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 10:48:06,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-10-16 10:48:06,266 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 109 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:06,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 292 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 10:48:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2022-10-16 10:48:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 205 states have (on average 1.2878048780487805) internal successors, (264), 217 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-10-16 10:48:06,295 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 47 [2022-10-16 10:48:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:06,296 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-10-16 10:48:06,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-10-16 10:48:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:48:06,297 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:06,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:06,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:06,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:06,511 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1504527277, now seen corresponding path program 1 times [2022-10-16 10:48:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:06,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978480180] [2022-10-16 10:48:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978480180] [2022-10-16 10:48:06,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978480180] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527047029] [2022-10-16 10:48:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:06,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:06,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:06,602 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 10:48:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:06,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:06,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:06,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:48:06,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527047029] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:06,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:48:06,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:48:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058343597] [2022-10-16 10:48:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:06,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:48:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:48:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:48:06,766 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:06,909 INFO L93 Difference]: Finished difference Result 221 states and 264 transitions. [2022-10-16 10:48:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:48:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 10:48:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:06,911 INFO L225 Difference]: With dead ends: 221 [2022-10-16 10:48:06,911 INFO L226 Difference]: Without dead ends: 220 [2022-10-16 10:48:06,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:48:06,912 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:06,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 135 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-16 10:48:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-10-16 10:48:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 216 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 258 transitions. [2022-10-16 10:48:06,945 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 258 transitions. Word has length 47 [2022-10-16 10:48:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:06,946 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 258 transitions. [2022-10-16 10:48:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 258 transitions. [2022-10-16 10:48:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 10:48:06,947 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:06,947 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, 1, 1, 1, 1, 1] [2022-10-16 10:48:06,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:07,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:07,160 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 671293921, now seen corresponding path program 2 times [2022-10-16 10:48:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:07,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249650830] [2022-10-16 10:48:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249650830] [2022-10-16 10:48:07,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249650830] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:07,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770496212] [2022-10-16 10:48:07,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:07,376 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:07,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 10:48:07,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:07,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:07,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:07,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:07,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770496212] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:07,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:07,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:48:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200415826] [2022-10-16 10:48:07,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:07,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:48:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:48:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:07,797 INFO L87 Difference]: Start difference. First operand 217 states and 258 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:08,310 INFO L93 Difference]: Finished difference Result 347 states and 388 transitions. [2022-10-16 10:48:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:48:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-10-16 10:48:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:08,312 INFO L225 Difference]: With dead ends: 347 [2022-10-16 10:48:08,312 INFO L226 Difference]: Without dead ends: 248 [2022-10-16 10:48:08,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:48:08,314 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 201 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:08,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 596 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-16 10:48:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2022-10-16 10:48:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-10-16 10:48:08,344 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 48 [2022-10-16 10:48:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:08,344 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-10-16 10:48:08,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-10-16 10:48:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-16 10:48:08,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:08,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:08,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:08,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-16 10:48:08,555 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -906486625, now seen corresponding path program 3 times [2022-10-16 10:48:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:08,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507987517] [2022-10-16 10:48:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507987517] [2022-10-16 10:48:08,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507987517] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247685351] [2022-10-16 10:48:08,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:08,757 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:08,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-10-16 10:48:08,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:48:08,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:08,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:08,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:09,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:09,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247685351] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:09,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:09,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:48:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628394464] [2022-10-16 10:48:09,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:48:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:48:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:09,231 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:09,635 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2022-10-16 10:48:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:48:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-10-16 10:48:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:09,636 INFO L225 Difference]: With dead ends: 276 [2022-10-16 10:48:09,637 INFO L226 Difference]: Without dead ends: 223 [2022-10-16 10:48:09,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:48:09,638 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:09,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 384 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-16 10:48:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2022-10-16 10:48:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 208 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2022-10-16 10:48:09,667 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 50 [2022-10-16 10:48:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:09,667 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2022-10-16 10:48:09,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2022-10-16 10:48:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 10:48:09,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:09,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:09,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-10-16 10:48:09,882 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1963638335, now seen corresponding path program 3 times [2022-10-16 10:48:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:09,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024512896] [2022-10-16 10:48:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:48:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024512896] [2022-10-16 10:48:12,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024512896] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425736849] [2022-10-16 10:48:12,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:12,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:12,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:12,611 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-10-16 10:48:12,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:48:12,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:12,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 68 conjunts are in the unsatisfiable core [2022-10-16 10:48:12,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:12,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:48:12,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,815 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:48:12,817 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 41 treesize of output 35 [2022-10-16 10:48:12,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:13,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:48:13,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-10-16 10:48:13,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,804 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:48:13,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 10:48:14,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:14,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:14,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:14,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-10-16 10:48:15,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:15,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-10-16 10:48:15,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:15,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:48:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 10:48:15,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:16,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1734) (< (+ v_ArrVal_1736 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) is different from false [2022-10-16 10:48:17,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808) (< (+ v_ArrVal_1734 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1736))))) is different from false [2022-10-16 10:48:17,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736) (< (+ v_ArrVal_1736 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) is different from false [2022-10-16 10:48:17,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736))))) is different from false [2022-10-16 10:48:17,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1726 Int) (v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1726)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1734) (not (<= v_ArrVal_1726 1)) (< (+ v_ArrVal_1736 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736))))) is different from false [2022-10-16 10:48:17,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1726 Int) (v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1726)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736) (not (<= v_ArrVal_1726 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808))))) is different from false [2022-10-16 10:48:17,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1726 Int) (v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1726)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1736 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (not (<= v_ArrVal_1726 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1734) v_ArrVal_1736))))) is different from false [2022-10-16 10:48:17,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1726 Int) (v_ArrVal_1732 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int) (v_ArrVal_1724 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1724) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1726))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1734 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1736) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808) (not (<= v_ArrVal_1726 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (not (<= v_ArrVal_1724 1)))))) is different from false [2022-10-16 10:48:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2022-10-16 10:48:17,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425736849] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:17,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:17,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 56 [2022-10-16 10:48:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946415502] [2022-10-16 10:48:17,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:17,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:48:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:48:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2138, Unknown=8, NotChecked=808, Total=3192 [2022-10-16 10:48:17,574 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:20,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse6 (select .cse4 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select .cse4 .cse2))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808) (< (+ v_ArrVal_1734 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_1736))))) (= (select .cse4 0) 1) (= .cse5 0) (<= .cse6 1) (<= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse5 .cse6) (<= .cse7 1) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse3 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse5 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse7 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:48:22,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (select .cse4 .cse2))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1734 Int) (v_ArrVal_1736 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1732))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1734) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1736)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1736) 9223372036854775808) (< (+ v_ArrVal_1734 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1734)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_1736))))) (= (select .cse4 0) 1) (= .cse5 0) (<= (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse6 1) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse5 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse3 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse6 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:48:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:24,507 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2022-10-16 10:48:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:48:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-10-16 10:48:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:24,510 INFO L225 Difference]: With dead ends: 219 [2022-10-16 10:48:24,510 INFO L226 Difference]: Without dead ends: 217 [2022-10-16 10:48:24,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=461, Invalid=3601, Unknown=10, NotChecked=1330, Total=5402 [2022-10-16 10:48:24,513 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 926 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:24,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 925 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 646 Invalid, 0 Unknown, 926 Unchecked, 0.6s Time] [2022-10-16 10:48:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-10-16 10:48:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 175. [2022-10-16 10:48:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 174 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2022-10-16 10:48:24,541 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 51 [2022-10-16 10:48:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:24,541 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2022-10-16 10:48:24,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2022-10-16 10:48:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:48:24,542 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:24,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:24,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:24,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-10-16 10:48:24,754 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 743246373, now seen corresponding path program 2 times [2022-10-16 10:48:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314861462] [2022-10-16 10:48:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:48:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314861462] [2022-10-16 10:48:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314861462] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246531143] [2022-10-16 10:48:27,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:27,428 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:27,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-10-16 10:48:27,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:27,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:27,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 10:48:27,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:27,579 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 414 treesize of output 406 [2022-10-16 10:48:27,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:48:27,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:27,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:28,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:48:28,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:48:28,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:28,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:48:28,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:28,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:48:28,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:28,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:48:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:28,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:32,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 10:48:32,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:48:32,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-10-16 10:48:32,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:48:32,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int)) (or (forall ((v_ArrVal_1806 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post9#1| 1) |v_ULTIMATE.start_main_~i~0#1_245|)))) is different from false [2022-10-16 10:48:32,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (v_ArrVal_1806 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_245| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-10-16 10:48:32,609 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:48:32,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:32,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 160 [2022-10-16 10:48:32,627 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 146 treesize of output 142 [2022-10-16 10:48:32,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,638 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 149 treesize of output 131 [2022-10-16 10:48:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2022-10-16 10:48:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246531143] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:32,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 42 [2022-10-16 10:48:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178913858] [2022-10-16 10:48:32,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-10-16 10:48:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-10-16 10:48:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1239, Unknown=8, NotChecked=380, Total=1806 [2022-10-16 10:48:32,822 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:33,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (v_ArrVal_1806 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse1 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_245| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 .cse3) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse3 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))))) is different from false [2022-10-16 10:48:35,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int)) (or (forall ((v_ArrVal_1806 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1809 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse1 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post9#1| 1) |v_ULTIMATE.start_main_~i~0#1_245|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= 0 |c_ULTIMATE.start_main_#t~post9#1|) (= (select .cse2 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:48:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:38,245 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2022-10-16 10:48:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 10:48:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 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 52 [2022-10-16 10:48:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:38,247 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:48:38,247 INFO L226 Difference]: Without dead ends: 197 [2022-10-16 10:48:38,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=626, Invalid=4362, Unknown=10, NotChecked=1008, Total=6006 [2022-10-16 10:48:38,250 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 453 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 613 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:38,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 719 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 715 Invalid, 0 Unknown, 613 Unchecked, 0.7s Time] [2022-10-16 10:48:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-16 10:48:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2022-10-16 10:48:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 167 states have (on average 1.2275449101796407) internal successors, (205), 178 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2022-10-16 10:48:38,276 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 52 [2022-10-16 10:48:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:38,276 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2022-10-16 10:48:38,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2022-10-16 10:48:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 10:48:38,277 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:38,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:38,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-10-16 10:48:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:38,478 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -754140411, now seen corresponding path program 2 times [2022-10-16 10:48:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:38,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026706371] [2022-10-16 10:48:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:48:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026706371] [2022-10-16 10:48:42,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026706371] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:42,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375060071] [2022-10-16 10:48:42,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:42,109 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:42,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-10-16 10:48:42,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:42,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:42,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 82 conjunts are in the unsatisfiable core [2022-10-16 10:48:42,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:42,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,286 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:48:42,287 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 32 treesize of output 26 [2022-10-16 10:48:42,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:48:42,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:42,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:48:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:48:43,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-10-16 10:48:44,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2022-10-16 10:48:44,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2022-10-16 10:48:44,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:44,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-10-16 10:48:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:45,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:45,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-10-16 10:48:46,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:46,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-10-16 10:48:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 25 [2022-10-16 10:48:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:48:46,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:49,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1900 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1902 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) 9223372036854775808))))) is different from false [2022-10-16 10:48:49,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1895 Int) (v_ArrVal_1900 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1895)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1902 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1900) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (not (<= v_ArrVal_1895 1)))))) is different from false [2022-10-16 10:48:49,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1895 Int) (v_ArrVal_1900 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post9#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1895)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (< (+ v_ArrVal_1900 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1902) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (not (<= v_ArrVal_1895 1)))))) is different from false [2022-10-16 10:48:49,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1895 Int) (v_ArrVal_1900 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1895)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1900 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1902) (< (+ v_ArrVal_1904 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1900) (not (<= v_ArrVal_1895 1)))))) is different from false [2022-10-16 10:48:49,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894) (+ .cse2 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1895))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (not (<= v_ArrVal_1894 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (< (+ v_ArrVal_1902 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) (< (+ v_ArrVal_1904 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1895 1)))))) is different from false [2022-10-16 10:48:49,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1894) .cse2 v_ArrVal_1895)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2) v_ArrVal_1904) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (not (<= v_ArrVal_1895 1)) (< (+ v_ArrVal_1900 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1902)))))) is different from false [2022-10-16 10:48:50,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse1 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1892)))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1894) .cse2 v_ArrVal_1895))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1900) (not (<= v_ArrVal_1892 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2) v_ArrVal_1904) 9223372036854775808) (not (<= v_ArrVal_1895 1))))))) is different from false [2022-10-16 10:48:50,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1892)))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1894) .cse2 v_ArrVal_1895))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (not (<= v_ArrVal_1892 1)) (< (+ v_ArrVal_1900 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1902) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2) v_ArrVal_1904) 9223372036854775808) (not (<= v_ArrVal_1895 1))))))) is different from false [2022-10-16 10:48:50,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1892)))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1894) .cse2 v_ArrVal_1895))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1900) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2) v_ArrVal_1904) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (< (+ v_ArrVal_1902 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1904) (not (<= v_ArrVal_1892 1)) (not (<= v_ArrVal_1895 1))))))) is different from false [2022-10-16 10:48:50,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1890 Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int) (v_ArrVal_1894 Int) (v_ArrVal_1900 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse1 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1890) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1892))))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1894) .cse2 v_ArrVal_1895))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1898))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1900) (not (<= v_ArrVal_1892 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1902)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1902) v_ArrVal_1904) (not (<= v_ArrVal_1890 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1900)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1900) v_ArrVal_1902) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1904)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2) v_ArrVal_1904) 9223372036854775808) (not (<= v_ArrVal_1895 1))))))) is different from false [2022-10-16 10:48:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2022-10-16 10:48:50,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375060071] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:50,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:50,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 75 [2022-10-16 10:48:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865410566] [2022-10-16 10:48:50,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-10-16 10:48:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-10-16 10:48:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4003, Unknown=10, NotChecked=1370, Total=5700 [2022-10-16 10:48:50,519 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 76 states, 75 states have (on average 2.1733333333333333) internal successors, (163), 76 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:57,430 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2022-10-16 10:48:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 10:48:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 2.1733333333333333) internal successors, (163), 76 states have internal predecessors, (163), 0 states have call successors, (0), 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 57 [2022-10-16 10:48:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:57,431 INFO L225 Difference]: With dead ends: 182 [2022-10-16 10:48:57,432 INFO L226 Difference]: Without dead ends: 181 [2022-10-16 10:48:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=746, Invalid=7840, Unknown=10, NotChecked=1910, Total=10506 [2022-10-16 10:48:57,434 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 293 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1093 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:57,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 948 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 571 Invalid, 0 Unknown, 1093 Unchecked, 0.6s Time] [2022-10-16 10:48:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-10-16 10:48:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-10-16 10:48:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 169 states have (on average 1.2307692307692308) internal successors, (208), 180 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2022-10-16 10:48:57,458 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 57 [2022-10-16 10:48:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:57,458 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2022-10-16 10:48:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 2.1733333333333333) internal successors, (163), 76 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2022-10-16 10:48:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 10:48:57,459 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:57,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:57,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:57,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:48:57,660 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2006695881, now seen corresponding path program 4 times [2022-10-16 10:48:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:57,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929641524] [2022-10-16 10:48:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:48:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929641524] [2022-10-16 10:48:57,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929641524] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722432200] [2022-10-16 10:48:57,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:48:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:57,879 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:48:57,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-10-16 10:48:58,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:48:58,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:58,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:58,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:48:58,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:48:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722432200] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:58,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:58,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:48:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752154873] [2022-10-16 10:48:58,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:48:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:48:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:58,416 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:59,038 INFO L93 Difference]: Finished difference Result 277 states and 305 transitions. [2022-10-16 10:48:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:48:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-10-16 10:48:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:59,040 INFO L225 Difference]: With dead ends: 277 [2022-10-16 10:48:59,040 INFO L226 Difference]: Without dead ends: 200 [2022-10-16 10:48:59,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:48:59,041 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 251 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:59,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 690 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:48:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-10-16 10:48:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2022-10-16 10:48:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 173 states have (on average 1.2254335260115607) internal successors, (212), 184 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2022-10-16 10:48:59,082 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 57 [2022-10-16 10:48:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:59,083 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2022-10-16 10:48:59,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2022-10-16 10:48:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:48:59,084 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:59,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:59,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-10-16 10:48:59,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 10:48:59,297 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1903516129, now seen corresponding path program 1 times [2022-10-16 10:48:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:59,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939326008] [2022-10-16 10:48:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:59,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:49:00,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:00,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939326008] [2022-10-16 10:49:00,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939326008] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:00,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490404206] [2022-10-16 10:49:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:00,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:00,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:00,325 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-10-16 10:49:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:00,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:49:00,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:00,481 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 202 treesize of output 198 [2022-10-16 10:49:00,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:49:00,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:00,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:00,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:00,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:00,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:00,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:00,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:49:01,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:01,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:49:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:01,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:05,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2054 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2054)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 v_ArrVal_2054)) (< (+ 9223372036854775808 v_ArrVal_2054) 0))) is different from false [2022-10-16 10:49:05,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:05,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-10-16 10:49:05,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:49:05,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2051 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2051) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:49:05,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:05,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-10-16 10:49:05,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:05,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 88 [2022-10-16 10:49:05,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:05,628 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 81 treesize of output 73 [2022-10-16 10:49:05,637 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 30 treesize of output 26 [2022-10-16 10:49:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-10-16 10:49:05,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490404206] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:05,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:05,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 38 [2022-10-16 10:49:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732115802] [2022-10-16 10:49:05,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:05,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-16 10:49:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-16 10:49:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1130, Unknown=5, NotChecked=210, Total=1482 [2022-10-16 10:49:05,933 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand has 39 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:08,046 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2022-10-16 10:49:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:49:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 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 58 [2022-10-16 10:49:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:08,048 INFO L225 Difference]: With dead ends: 211 [2022-10-16 10:49:08,048 INFO L226 Difference]: Without dead ends: 210 [2022-10-16 10:49:08,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 98 SyntacticMatches, 18 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=363, Invalid=2094, Unknown=5, NotChecked=294, Total=2756 [2022-10-16 10:49:08,049 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 430 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:08,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 595 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 659 Invalid, 0 Unknown, 298 Unchecked, 0.5s Time] [2022-10-16 10:49:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-16 10:49:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2022-10-16 10:49:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 177 states have (on average 1.231638418079096) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2022-10-16 10:49:08,081 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 58 [2022-10-16 10:49:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:08,082 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2022-10-16 10:49:08,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2022-10-16 10:49:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:49:08,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:08,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:08,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-10-16 10:49:08,283 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1120494805, now seen corresponding path program 2 times [2022-10-16 10:49:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698579018] [2022-10-16 10:49:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:08,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698579018] [2022-10-16 10:49:08,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698579018] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:08,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983730430] [2022-10-16 10:49:08,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:08,433 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:08,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-10-16 10:49:08,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:08,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:08,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:49:08,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:08,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983730430] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:08,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:08,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:49:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661567781] [2022-10-16 10:49:08,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:49:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:49:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:49:08,894 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:09,245 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-10-16 10:49:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:49:09,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-10-16 10:49:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:09,247 INFO L225 Difference]: With dead ends: 234 [2022-10-16 10:49:09,247 INFO L226 Difference]: Without dead ends: 201 [2022-10-16 10:49:09,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:49:09,248 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 180 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:09,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 327 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-16 10:49:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2022-10-16 10:49:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 177 states have (on average 1.2203389830508475) internal successors, (216), 188 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2022-10-16 10:49:09,273 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 59 [2022-10-16 10:49:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:09,273 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2022-10-16 10:49:09,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2022-10-16 10:49:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 10:49:09,274 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:09,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:09,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-10-16 10:49:09,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 10:49:09,475 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 377072417, now seen corresponding path program 1 times [2022-10-16 10:49:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235236788] [2022-10-16 10:49:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:49:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235236788] [2022-10-16 10:49:09,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235236788] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409216573] [2022-10-16 10:49:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:09,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:09,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:09,561 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:09,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-10-16 10:49:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:09,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:09,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:49:09,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:49:09,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409216573] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:09,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:09,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:49:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500695423] [2022-10-16 10:49:09,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:09,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:49:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:49:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:49:09,821 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:10,071 INFO L93 Difference]: Finished difference Result 235 states and 274 transitions. [2022-10-16 10:49:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:49:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-10-16 10:49:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:10,073 INFO L225 Difference]: With dead ends: 235 [2022-10-16 10:49:10,073 INFO L226 Difference]: Without dead ends: 234 [2022-10-16 10:49:10,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:49:10,074 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 70 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:10,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-10-16 10:49:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 217. [2022-10-16 10:49:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 216 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2022-10-16 10:49:10,118 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 60 [2022-10-16 10:49:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:10,118 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2022-10-16 10:49:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2022-10-16 10:49:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:49:10,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:10,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:10,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-10-16 10:49:10,334 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1195656823, now seen corresponding path program 1 times [2022-10-16 10:49:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084921723] [2022-10-16 10:49:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:49:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084921723] [2022-10-16 10:49:10,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084921723] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502749718] [2022-10-16 10:49:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:10,435 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:10,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-10-16 10:49:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:10,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:10,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:49:10,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:49:10,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502749718] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:10,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:49:10,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:49:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312511280] [2022-10-16 10:49:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:10,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:49:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:49:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:49:10,622 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:10,734 INFO L93 Difference]: Finished difference Result 220 states and 260 transitions. [2022-10-16 10:49:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:49:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-10-16 10:49:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:10,736 INFO L225 Difference]: With dead ends: 220 [2022-10-16 10:49:10,736 INFO L226 Difference]: Without dead ends: 219 [2022-10-16 10:49:10,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:49:10,736 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:10,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 122 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-16 10:49:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-10-16 10:49:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.2390243902439024) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-10-16 10:49:10,778 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 61 [2022-10-16 10:49:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:10,779 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-10-16 10:49:10,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-10-16 10:49:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:49:10,780 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:10,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:10,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:10,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:10,993 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1696907333, now seen corresponding path program 5 times [2022-10-16 10:49:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:10,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785932944] [2022-10-16 10:49:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:49:13,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:13,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785932944] [2022-10-16 10:49:13,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785932944] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:13,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364374533] [2022-10-16 10:49:13,658 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:49:13,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:13,659 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:13,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-10-16 10:49:13,932 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:49:13,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 77 conjunts are in the unsatisfiable core [2022-10-16 10:49:13,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:13,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:49:13,961 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:49:13,962 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 40 treesize of output 34 [2022-10-16 10:49:14,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:49:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:14,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:49:14,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:14,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 10:49:15,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:15,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:15,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:15,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:15,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:15,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 10:49:16,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:49:16,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:16,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:16,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-10-16 10:49:16,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:16,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:16,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:49:16,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2022-10-16 10:49:17,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:49:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:49:17,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:18,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_2364) v_ArrVal_2366) (< (+ v_ArrVal_2366 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2364))))) is different from false [2022-10-16 10:49:18,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_2364 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_2366) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_2364) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2366) 9223372036854775808))))) is different from false [2022-10-16 10:49:19,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_2364 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_2366) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2366) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2364))))) is different from false [2022-10-16 10:49:19,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_2364) v_ArrVal_2366) (< (+ v_ArrVal_2366 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_2364))))) is different from false [2022-10-16 10:49:19,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_2364) v_ArrVal_2366) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2364) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2366) 9223372036854775808))))) is different from false [2022-10-16 10:49:19,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_2364) (< (+ v_ArrVal_2366 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ v_ArrVal_2364 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_2366))))) is different from false [2022-10-16 10:49:19,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_#t~post8#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_2364 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_2366) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2366) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_2364))))) is different from false [2022-10-16 10:49:19,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2364) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2366) 9223372036854775808) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_2364) v_ArrVal_2366))))) is different from false [2022-10-16 10:49:19,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2352 Int) (v_ArrVal_2366 Int) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2352) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2363))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_2366 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2366)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_2364) (not (<= v_ArrVal_2352 1)) (< (+ v_ArrVal_2364 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2364)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_2366))))) is different from false [2022-10-16 10:49:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 33 not checked. [2022-10-16 10:49:19,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364374533] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:19,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:19,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2022-10-16 10:49:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352045389] [2022-10-16 10:49:19,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:19,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-10-16 10:49:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-10-16 10:49:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2630, Unknown=9, NotChecked=1008, Total=3906 [2022-10-16 10:49:19,649 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 63 states, 62 states have (on average 2.435483870967742) internal successors, (151), 63 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:24,051 INFO L93 Difference]: Finished difference Result 222 states and 258 transitions. [2022-10-16 10:49:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:49:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.435483870967742) internal successors, (151), 63 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-10-16 10:49:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:24,053 INFO L225 Difference]: With dead ends: 222 [2022-10-16 10:49:24,053 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 10:49:24,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=518, Invalid=4765, Unknown=9, NotChecked=1350, Total=6642 [2022-10-16 10:49:24,054 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 165 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1173 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:24,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1437 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1482 Invalid, 0 Unknown, 1173 Unchecked, 1.2s Time] [2022-10-16 10:49:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 10:49:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2022-10-16 10:49:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 215 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2022-10-16 10:49:24,081 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 61 [2022-10-16 10:49:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:24,082 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2022-10-16 10:49:24,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.435483870967742) internal successors, (151), 63 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2022-10-16 10:49:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-16 10:49:24,083 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:24,083 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:24,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-10-16 10:49:24,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-10-16 10:49:24,285 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1064519661, now seen corresponding path program 4 times [2022-10-16 10:49:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:24,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727004449] [2022-10-16 10:49:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:49:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:25,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727004449] [2022-10-16 10:49:25,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727004449] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:25,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044874808] [2022-10-16 10:49:25,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:49:25,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:25,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:25,461 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:25,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-10-16 10:49:25,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:49:25,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:25,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-16 10:49:25,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:25,711 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:49:25,712 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 173 treesize of output 167 [2022-10-16 10:49:26,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:49:26,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:26,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:26,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:26,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:49:26,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:26,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:49:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:49:26,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:37,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:37,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:49:37,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775809 .cse0)) (< (+ 9223372036854775808 .cse0) 0)))) is different from false [2022-10-16 10:49:37,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ 9223372036854775809 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0))))) is different from false [2022-10-16 10:49:37,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2456) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:49:37,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2453 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_2453) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2456) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ 9223372036854775808 .cse0) 0)))) is different from false [2022-10-16 10:49:37,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:37,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-10-16 10:49:37,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:37,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 348 [2022-10-16 10:49:37,561 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 167 treesize of output 151 [2022-10-16 10:49:37,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:37,573 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 325 treesize of output 269 [2022-10-16 10:49:37,581 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 254 treesize of output 246 [2022-10-16 10:49:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 33 not checked. [2022-10-16 10:49:38,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044874808] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:38,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:38,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 48 [2022-10-16 10:49:38,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691303568] [2022-10-16 10:49:38,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-16 10:49:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-16 10:49:38,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1842, Unknown=11, NotChecked=356, Total=2352 [2022-10-16 10:49:38,171 INFO L87 Difference]: Start difference. First operand 216 states and 253 transitions. Second operand has 49 states, 48 states have (on average 3.2083333333333335) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:41,188 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2022-10-16 10:49:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:49:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.2083333333333335) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-10-16 10:49:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:41,190 INFO L225 Difference]: With dead ends: 230 [2022-10-16 10:49:41,190 INFO L226 Difference]: Without dead ends: 229 [2022-10-16 10:49:41,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 97 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=345, Invalid=3200, Unknown=11, NotChecked=476, Total=4032 [2022-10-16 10:49:41,191 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 537 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:41,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1582 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1410 Invalid, 0 Unknown, 587 Unchecked, 1.0s Time] [2022-10-16 10:49:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-16 10:49:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2022-10-16 10:49:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 215 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2022-10-16 10:49:41,232 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 62 [2022-10-16 10:49:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:41,232 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2022-10-16 10:49:41,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.2083333333333335) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2022-10-16 10:49:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:49:41,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:41,233 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:41,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:41,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:41,448 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2025032523, now seen corresponding path program 3 times [2022-10-16 10:49:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:41,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145720621] [2022-10-16 10:49:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145720621] [2022-10-16 10:49:41,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145720621] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770069298] [2022-10-16 10:49:41,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:49:41,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:41,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:41,630 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:41,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-10-16 10:49:41,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:49:41,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:41,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:49:41,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:42,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:49:42,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770069298] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:42,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:42,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:49:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909188198] [2022-10-16 10:49:42,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:42,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:49:42,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:49:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:49:42,242 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:42,613 INFO L93 Difference]: Finished difference Result 247 states and 273 transitions. [2022-10-16 10:49:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:49:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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 63 [2022-10-16 10:49:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:42,614 INFO L225 Difference]: With dead ends: 247 [2022-10-16 10:49:42,615 INFO L226 Difference]: Without dead ends: 211 [2022-10-16 10:49:42,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:49:42,616 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 264 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:42,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 380 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-10-16 10:49:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2022-10-16 10:49:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 189 states have (on average 1.1957671957671958) internal successors, (226), 199 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2022-10-16 10:49:42,645 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 63 [2022-10-16 10:49:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:42,645 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2022-10-16 10:49:42,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2022-10-16 10:49:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:49:42,646 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:42,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:42,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:42,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-10-16 10:49:42,849 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:49:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 436026267, now seen corresponding path program 3 times [2022-10-16 10:49:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949151284] [2022-10-16 10:49:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949151284] [2022-10-16 10:49:48,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949151284] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447750466] [2022-10-16 10:49:48,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:49:48,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:48,566 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:48,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-10-16 10:49:48,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:49:48,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:48,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 103 conjunts are in the unsatisfiable core [2022-10-16 10:49:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:48,789 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:49:48,789 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 32 treesize of output 26 [2022-10-16 10:49:48,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:49:48,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:49:49,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:49,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:49:49,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:49,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:49,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:49:50,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:50,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:50,417 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:49:50,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 60 [2022-10-16 10:49:51,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2022-10-16 10:49:51,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:51,998 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:49:51,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 78 [2022-10-16 10:49:53,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:49:53,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:53,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:53,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2022-10-16 10:49:54,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2022-10-16 10:49:54,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:49:54,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:54,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 76 [2022-10-16 10:49:56,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:56,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:56,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:56,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:49:56,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2022-10-16 10:49:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:57,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:57,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:57,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 29 [2022-10-16 10:49:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:49:57,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:03,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2629 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_2631 Int) (v_ArrVal_2633 Int) (v_ArrVal_2626 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_2631 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2631)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) v_ArrVal_2633) (< (+ v_ArrVal_2633 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2633)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_2626) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2626)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_2626) v_ArrVal_2629) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_2629)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_2629) v_ArrVal_2631))))) is different from false