/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-patterns/array6_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 11:21:59,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 11:21:59,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 11:21:59,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 11:21:59,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 11:21:59,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 11:21:59,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 11:21:59,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 11:21:59,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 11:21:59,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 11:21:59,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 11:21:59,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 11:21:59,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 11:21:59,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 11:21:59,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 11:21:59,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 11:21:59,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 11:21:59,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 11:21:59,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 11:21:59,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 11:21:59,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 11:21:59,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 11:21:59,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 11:21:59,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 11:21:59,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 11:21:59,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 11:21:59,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 11:21:59,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 11:21:59,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 11:21:59,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 11:21:59,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 11:21:59,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 11:21:59,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 11:21:59,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 11:21:59,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 11:21:59,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 11:21:59,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 11:21:59,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 11:21:59,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 11:21:59,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 11:21:59,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 11:21:59,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 11:21:59,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 11:21:59,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 11:21:59,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 11:21:59,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 11:21:59,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 11:21:59,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 11:21:59,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 11:21:59,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 11:21:59,571 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 11:21:59,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 11:21:59,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 11:21:59,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 11:21:59,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 11:21:59,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 11:21:59,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 11:21:59,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 11:21:59,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 11:21:59,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 11:21:59,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 11:21:59,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 11:21:59,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 11:21:59,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:21:59,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 11:21:59,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 11:21:59,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 11:21:59,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 11:21:59,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 11:21:59,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 11:21:59,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 11:21:59,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 11:21:59,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 11:21:59,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 11:21:59,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 11:21:59,946 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 11:21:59,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array6_pattern.c [2022-10-16 11:22:00,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6faedb3/c98235fdadca4223b7c25266f2f7a2f3/FLAGbc6f18259 [2022-10-16 11:22:00,709 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 11:22:00,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c [2022-10-16 11:22:00,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6faedb3/c98235fdadca4223b7c25266f2f7a2f3/FLAGbc6f18259 [2022-10-16 11:22:01,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6faedb3/c98235fdadca4223b7c25266f2f7a2f3 [2022-10-16 11:22:01,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 11:22:01,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 11:22:01,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 11:22:01,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 11:22:01,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 11:22:01,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e794edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01, skipping insertion in model container [2022-10-16 11:22:01,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 11:22:01,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 11:22:01,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c[1356,1369] [2022-10-16 11:22:01,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:22:01,297 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 11:22:01,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array6_pattern.c[1356,1369] [2022-10-16 11:22:01,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:22:01,341 INFO L208 MainTranslator]: Completed translation [2022-10-16 11:22:01,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01 WrapperNode [2022-10-16 11:22:01,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 11:22:01,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 11:22:01,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 11:22:01,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 11:22:01,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,391 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2022-10-16 11:22:01,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 11:22:01,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 11:22:01,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 11:22:01,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 11:22:01,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,421 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 11:22:01,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 11:22:01,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 11:22:01,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 11:22:01,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (1/1) ... [2022-10-16 11:22:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:22:01,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:01,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 11:22:01,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 11:22:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 11:22:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 11:22:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 11:22:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 11:22:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 11:22:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 11:22:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 11:22:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 11:22:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 11:22:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 11:22:01,613 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 11:22:01,616 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 11:22:01,903 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 11:22:01,913 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 11:22:01,914 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 11:22:01,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:22:01 BoogieIcfgContainer [2022-10-16 11:22:01,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 11:22:01,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 11:22:01,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 11:22:01,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 11:22:01,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:22:01" (1/3) ... [2022-10-16 11:22:01,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:22:01, skipping insertion in model container [2022-10-16 11:22:01,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:22:01" (2/3) ... [2022-10-16 11:22:01,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:22:01, skipping insertion in model container [2022-10-16 11:22:01,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:22:01" (3/3) ... [2022-10-16 11:22:01,942 INFO L112 eAbstractionObserver]: Analyzing ICFG array6_pattern.c [2022-10-16 11:22:01,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 11:22:01,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-10-16 11:22:02,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 11:22:02,059 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;@52b2ab9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 11:22:02,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-10-16 11:22:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 11:22:02,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:02,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:02,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1807890334, now seen corresponding path program 1 times [2022-10-16 11:22:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:02,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378051550] [2022-10-16 11:22:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:02,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:02,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378051550] [2022-10-16 11:22:02,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-10-16 11:22:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663937507] [2022-10-16 11:22:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:02,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:02,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:02,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 11:22:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:02,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjunts are in the unsatisfiable core [2022-10-16 11:22:02,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:02,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:02,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663937507] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:02,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:02,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056002636] [2022-10-16 11:22:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 11:22:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 11:22:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 11:22:02,449 INFO L87 Difference]: Start difference. First operand has 81 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:02,490 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2022-10-16 11:22:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 11:22:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-16 11:22:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:02,502 INFO L225 Difference]: With dead ends: 159 [2022-10-16 11:22:02,502 INFO L226 Difference]: Without dead ends: 74 [2022-10-16 11:22:02,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 11:22:02,511 INFO L413 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:02,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-16 11:22:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-10-16 11:22:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-10-16 11:22:02,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 10 [2022-10-16 11:22:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:02,567 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-10-16 11:22:02,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-10-16 11:22:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 11:22:02,569 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:02,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:02,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-10-16 11:22:02,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1865148636, now seen corresponding path program 1 times [2022-10-16 11:22:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:02,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100114561] [2022-10-16 11:22:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:02,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:02,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035130244] [2022-10-16 11:22:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:02,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:02,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:02,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:02,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 11:22:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:02,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:22:02,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:02,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100114561] [2022-10-16 11:22:02,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035130244] [2022-10-16 11:22:02,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035130244] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:02,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:02,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519502270] [2022-10-16 11:22:02,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:02,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:02,944 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:03,074 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-10-16 11:22:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-16 11:22:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:03,079 INFO L225 Difference]: With dead ends: 140 [2022-10-16 11:22:03,079 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 11:22:03,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:03,084 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:03,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 11:22:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 80. [2022-10-16 11:22:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-10-16 11:22:03,121 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 10 [2022-10-16 11:22:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:03,122 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-10-16 11:22:03,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-10-16 11:22:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 11:22:03,123 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:03,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:03,163 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 11:22:03,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-10-16 11:22:03,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1985032914, now seen corresponding path program 1 times [2022-10-16 11:22:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295003907] [2022-10-16 11:22:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:03,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:03,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003875102] [2022-10-16 11:22:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:03,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:03,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:03,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:03,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 11:22:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:03,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:22:03,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:03,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:03,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295003907] [2022-10-16 11:22:03,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:03,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003875102] [2022-10-16 11:22:03,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003875102] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:03,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:03,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925952360] [2022-10-16 11:22:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:03,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:03,473 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:03,579 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2022-10-16 11:22:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-10-16 11:22:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:03,582 INFO L225 Difference]: With dead ends: 137 [2022-10-16 11:22:03,582 INFO L226 Difference]: Without dead ends: 134 [2022-10-16 11:22:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:03,585 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 57 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:03,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 164 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-16 11:22:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2022-10-16 11:22:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.64) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-10-16 11:22:03,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 11 [2022-10-16 11:22:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:03,599 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-10-16 11:22:03,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-10-16 11:22:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 11:22:03,600 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:03,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:03,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:03,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1406445499, now seen corresponding path program 1 times [2022-10-16 11:22:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683057226] [2022-10-16 11:22:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:03,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683057226] [2022-10-16 11:22:03,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683057226] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:03,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:03,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955524724] [2022-10-16 11:22:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:03,978 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:04,015 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-10-16 11:22:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-10-16 11:22:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:04,017 INFO L225 Difference]: With dead ends: 81 [2022-10-16 11:22:04,017 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 11:22:04,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:04,022 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:04,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 11:22:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-10-16 11:22:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.62) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-10-16 11:22:04,042 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 12 [2022-10-16 11:22:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:04,047 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-10-16 11:22:04,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-10-16 11:22:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 11:22:04,048 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:04,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:04,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 11:22:04,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 650137587, now seen corresponding path program 1 times [2022-10-16 11:22:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:04,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778469919] [2022-10-16 11:22:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:04,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778469919] [2022-10-16 11:22:04,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778469919] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:04,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:04,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083979323] [2022-10-16 11:22:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:04,177 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:04,205 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-10-16 11:22:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-16 11:22:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:04,210 INFO L225 Difference]: With dead ends: 80 [2022-10-16 11:22:04,210 INFO L226 Difference]: Without dead ends: 79 [2022-10-16 11:22:04,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:04,215 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:04,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-16 11:22:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-10-16 11:22:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.6) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-10-16 11:22:04,234 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 13 [2022-10-16 11:22:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:04,234 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-10-16 11:22:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-10-16 11:22:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 11:22:04,239 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:04,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:04,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 11:22:04,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -560706343, now seen corresponding path program 1 times [2022-10-16 11:22:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434875832] [2022-10-16 11:22:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 11:22:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:22:04,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434875832] [2022-10-16 11:22:04,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434875832] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:04,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:04,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:22:04,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026099737] [2022-10-16 11:22:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:22:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:22:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:22:04,443 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:04,564 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-10-16 11:22:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:22:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-10-16 11:22:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:04,568 INFO L225 Difference]: With dead ends: 118 [2022-10-16 11:22:04,568 INFO L226 Difference]: Without dead ends: 114 [2022-10-16 11:22:04,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:22:04,574 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:04,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-10-16 11:22:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2022-10-16 11:22:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-10-16 11:22:04,586 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2022-10-16 11:22:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:04,586 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-10-16 11:22:04,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-10-16 11:22:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 11:22:04,587 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:04,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:04,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 11:22:04,588 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1723987800, now seen corresponding path program 1 times [2022-10-16 11:22:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:04,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651368319] [2022-10-16 11:22:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:04,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:04,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886944954] [2022-10-16 11:22:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:04,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:04,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 11:22:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:04,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 11:22:04,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:04,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:04,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651368319] [2022-10-16 11:22:04,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:04,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886944954] [2022-10-16 11:22:04,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886944954] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:04,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:04,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:22:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837674844] [2022-10-16 11:22:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:04,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:22:04,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:22:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:22:04,745 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:04,823 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-10-16 11:22:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:22:04,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-10-16 11:22:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:04,826 INFO L225 Difference]: With dead ends: 152 [2022-10-16 11:22:04,826 INFO L226 Difference]: Without dead ends: 151 [2022-10-16 11:22:04,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:22:04,828 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 175 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-16 11:22:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2022-10-16 11:22:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.564516129032258) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-10-16 11:22:04,849 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 17 [2022-10-16 11:22:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:04,849 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-10-16 11:22:04,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-10-16 11:22:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 11:22:04,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:04,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:04,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:05,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:05,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -202027362, now seen corresponding path program 1 times [2022-10-16 11:22:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959294961] [2022-10-16 11:22:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 11:22:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:22:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:05,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959294961] [2022-10-16 11:22:05,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959294961] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:05,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:05,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104525821] [2022-10-16 11:22:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:05,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:05,195 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:05,224 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-10-16 11:22:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-10-16 11:22:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:05,226 INFO L225 Difference]: With dead ends: 93 [2022-10-16 11:22:05,226 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 11:22:05,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:05,228 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:05,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 84 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 11:22:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-10-16 11:22:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-10-16 11:22:05,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 19 [2022-10-16 11:22:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:05,238 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-10-16 11:22:05,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-10-16 11:22:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 11:22:05,239 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:05,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 11:22:05,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1904014308, now seen corresponding path program 1 times [2022-10-16 11:22:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:05,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944308388] [2022-10-16 11:22:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:05,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:05,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275482446] [2022-10-16 11:22:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:05,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:05,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:05,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 11:22:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 11:22:05,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:05,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:05,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944308388] [2022-10-16 11:22:05,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275482446] [2022-10-16 11:22:05,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275482446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:05,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:05,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:22:05,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149173340] [2022-10-16 11:22:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:05,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:22:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:22:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:22:05,367 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:05,431 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-10-16 11:22:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:22:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 11:22:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:05,432 INFO L225 Difference]: With dead ends: 102 [2022-10-16 11:22:05,432 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 11:22:05,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:22:05,434 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:05,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 11:22:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2022-10-16 11:22:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-10-16 11:22:05,443 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 18 [2022-10-16 11:22:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:05,444 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-10-16 11:22:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-10-16 11:22:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 11:22:05,446 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:05,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:05,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:05,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:05,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:05,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 47484957, now seen corresponding path program 1 times [2022-10-16 11:22:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:05,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683444884] [2022-10-16 11:22:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-16 11:22:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:22:05,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:05,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683444884] [2022-10-16 11:22:05,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683444884] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:05,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:05,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:22:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304857244] [2022-10-16 11:22:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:05,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:22:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:22:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:05,730 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:05,758 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-10-16 11:22:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:22:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-10-16 11:22:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:05,759 INFO L225 Difference]: With dead ends: 87 [2022-10-16 11:22:05,760 INFO L226 Difference]: Without dead ends: 83 [2022-10-16 11:22:05,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:22:05,761 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:05,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-16 11:22:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-10-16 11:22:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-10-16 11:22:05,769 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 20 [2022-10-16 11:22:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:05,770 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-10-16 11:22:05,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-10-16 11:22:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 11:22:05,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:05,771 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:05,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 11:22:05,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 101683238, now seen corresponding path program 1 times [2022-10-16 11:22:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:05,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940120128] [2022-10-16 11:22:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:05,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:05,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120148801] [2022-10-16 11:22:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:05,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:05,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:05,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 11:22:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:05,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 11:22:05,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:05,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940120128] [2022-10-16 11:22:05,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120148801] [2022-10-16 11:22:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120148801] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:05,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:22:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418723244] [2022-10-16 11:22:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:06,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:22:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:22:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:22:06,004 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:06,123 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-10-16 11:22:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:22:06,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-10-16 11:22:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:06,125 INFO L225 Difference]: With dead ends: 110 [2022-10-16 11:22:06,126 INFO L226 Difference]: Without dead ends: 108 [2022-10-16 11:22:06,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:22:06,128 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 78 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:06,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 202 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-16 11:22:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2022-10-16 11:22:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-10-16 11:22:06,141 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 20 [2022-10-16 11:22:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:06,142 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-10-16 11:22:06,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-10-16 11:22:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 11:22:06,143 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:06,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:06,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:06,360 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 11:22:06,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1347871203, now seen corresponding path program 1 times [2022-10-16 11:22:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111619682] [2022-10-16 11:22:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 11:22:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:22:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:06,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111619682] [2022-10-16 11:22:06,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111619682] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:06,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:22:06,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 11:22:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540148452] [2022-10-16 11:22:06,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:06,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:22:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:22:06,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:22:06,463 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:06,506 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-10-16 11:22:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:22:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-10-16 11:22:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:06,508 INFO L225 Difference]: With dead ends: 112 [2022-10-16 11:22:06,508 INFO L226 Difference]: Without dead ends: 69 [2022-10-16 11:22:06,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 11:22:06,509 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:06,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:22:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-16 11:22:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-10-16 11:22:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-10-16 11:22:06,517 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 22 [2022-10-16 11:22:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:06,517 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-10-16 11:22:06,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-10-16 11:22:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 11:22:06,518 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:06,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:06,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 11:22:06,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1142786872, now seen corresponding path program 1 times [2022-10-16 11:22:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:06,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219273713] [2022-10-16 11:22:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:06,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:06,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030176528] [2022-10-16 11:22:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:06,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:06,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 11:22:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:06,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:22:06,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:22:06,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:22:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:22:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219273713] [2022-10-16 11:22:07,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030176528] [2022-10-16 11:22:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030176528] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:22:07,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:22:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-10-16 11:22:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891885980] [2022-10-16 11:22:07,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:22:07,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 11:22:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 11:22:07,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:22:07,078 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:07,150 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-10-16 11:22:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:22:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-10-16 11:22:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:07,152 INFO L225 Difference]: With dead ends: 94 [2022-10-16 11:22:07,152 INFO L226 Difference]: Without dead ends: 91 [2022-10-16 11:22:07,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 11:22:07,154 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 164 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:07,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 126 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-10-16 11:22:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-16 11:22:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2022-10-16 11:22:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-10-16 11:22:07,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2022-10-16 11:22:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:07,162 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-10-16 11:22:07,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-10-16 11:22:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 11:22:07,169 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:07,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:07,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:07,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1741561697, now seen corresponding path program 1 times [2022-10-16 11:22:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905218042] [2022-10-16 11:22:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 11:22:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-16 11:22:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:07,493 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 11:22:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:07,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905218042] [2022-10-16 11:22:07,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905218042] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:22:07,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552443177] [2022-10-16 11:22:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:07,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:07,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:07,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 11:22:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:07,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 11:22:07,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:07,584 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 11:22:07,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:22:07,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552443177] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:22:07,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:22:07,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-10-16 11:22:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092226829] [2022-10-16 11:22:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:22:07,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:22:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:22:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:22:07,588 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:07,680 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-10-16 11:22:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 11:22:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-10-16 11:22:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:07,682 INFO L225 Difference]: With dead ends: 127 [2022-10-16 11:22:07,682 INFO L226 Difference]: Without dead ends: 85 [2022-10-16 11:22:07,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:22:07,683 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 103 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:07,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 158 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-10-16 11:22:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-10-16 11:22:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-10-16 11:22:07,690 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 24 [2022-10-16 11:22:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-10-16 11:22:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-10-16 11:22:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 11:22:07,691 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:07,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:07,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:07,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 11:22:07,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -975476530, now seen corresponding path program 1 times [2022-10-16 11:22:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863940662] [2022-10-16 11:22:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:07,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:07,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561446797] [2022-10-16 11:22:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:07,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:07,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 11:22:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:07,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:22:07,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:08,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:22:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863940662] [2022-10-16 11:22:08,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561446797] [2022-10-16 11:22:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561446797] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:22:08,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:22:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-10-16 11:22:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325726360] [2022-10-16 11:22:08,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:22:08,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 11:22:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 11:22:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:22:08,084 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:08,219 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2022-10-16 11:22:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 11:22:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-10-16 11:22:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:08,221 INFO L225 Difference]: With dead ends: 188 [2022-10-16 11:22:08,221 INFO L226 Difference]: Without dead ends: 187 [2022-10-16 11:22:08,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-10-16 11:22:08,223 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:08,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 312 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:22:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-10-16 11:22:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 100. [2022-10-16 11:22:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.188235294117647) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-10-16 11:22:08,232 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 27 [2022-10-16 11:22:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:08,233 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-10-16 11:22:08,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 11:22:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-10-16 11:22:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 11:22:08,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:08,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:08,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:08,449 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 11:22:08,450 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -785498837, now seen corresponding path program 1 times [2022-10-16 11:22:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:08,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017832233] [2022-10-16 11:22:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:08,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:08,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953025058] [2022-10-16 11:22:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:08,465 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:08,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 11:22:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:08,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 11:22:08,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:08,661 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 11:22:08,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:22:08,780 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 11:22:08,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:08,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017832233] [2022-10-16 11:22:08,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:08,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953025058] [2022-10-16 11:22:08,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953025058] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:22:08,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:22:08,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-10-16 11:22:08,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689568933] [2022-10-16 11:22:08,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:22:08,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 11:22:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 11:22:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-10-16 11:22:08,784 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:09,158 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2022-10-16 11:22:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 11:22:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-10-16 11:22:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:09,160 INFO L225 Difference]: With dead ends: 174 [2022-10-16 11:22:09,160 INFO L226 Difference]: Without dead ends: 114 [2022-10-16 11:22:09,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2022-10-16 11:22:09,162 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 87 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:09,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 341 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:22:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-10-16 11:22:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2022-10-16 11:22:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 95 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-10-16 11:22:09,170 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 34 [2022-10-16 11:22:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:09,171 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-10-16 11:22:09,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:22:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-10-16 11:22:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 11:22:09,172 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:09,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:22:09,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:09,385 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 11:22:09,386 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1524335809, now seen corresponding path program 2 times [2022-10-16 11:22:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087173754] [2022-10-16 11:22:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:09,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:09,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538748814] [2022-10-16 11:22:09,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:22:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:09,403 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:09,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 11:22:09,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:22:09,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:22:09,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 11:22:09,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:09,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:22:09,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:22:09,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-10-16 11:22:09,815 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 11:22:09,815 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 30 treesize of output 37 [2022-10-16 11:22:09,918 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 34 treesize of output 36 [2022-10-16 11:22:10,279 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 11:22:10,280 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 40 treesize of output 47 [2022-10-16 11:22:10,376 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 42 treesize of output 42 [2022-10-16 11:22:16,101 INFO L356 Elim1Store]: treesize reduction 62, result has 10.1 percent of original size [2022-10-16 11:22:16,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 19 [2022-10-16 11:22:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:22:16,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:22:17,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_28| Int)) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (not (<= v_ArrVal_230 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (< |c_ULTIMATE.start_main_~count~0#1| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4)) v_ArrVal_230)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))))) 2147483648))) is different from false [2022-10-16 11:22:20,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))))) 2147483648)))) is different from false [2022-10-16 11:22:20,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) is different from false [2022-10-16 11:22:21,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~count~0#1_38| Int) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (v_ArrVal_226 Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< (+ |v_ULTIMATE.start_main_~count~0#1_38| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_38|) (< (let ((.cse1 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4)) v_ArrVal_226)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) is different from false [2022-10-16 11:22:21,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~count~0#1_38| Int) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_226 Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< (+ |v_ULTIMATE.start_main_~count~0#1_38| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_38|) (< (let ((.cse1 (select (store (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_225))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4)) v_ArrVal_226))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) is different from false [2022-10-16 11:22:21,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:22:21,827 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 233 treesize of output 150 [2022-10-16 11:22:21,850 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 325 treesize of output 319 [2022-10-16 11:22:21,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:22:21,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:22:21,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 299 [2022-10-16 11:22:21,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 453 treesize of output 397 [2022-10-16 11:22:21,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:22:21,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 437 treesize of output 395 [2022-10-16 11:22:21,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:22:21,984 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 557 treesize of output 523 [2022-10-16 11:22:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-10-16 11:22:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:22:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087173754] [2022-10-16 11:22:24,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:22:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538748814] [2022-10-16 11:22:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538748814] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:22:24,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:22:24,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2022-10-16 11:22:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135935933] [2022-10-16 11:22:24,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:22:24,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 11:22:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:22:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 11:22:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1448, Unknown=18, NotChecked=410, Total=2070 [2022-10-16 11:22:24,101 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 46 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 45 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:26,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< .cse1 |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) (<= |c_ULTIMATE.start_main_~count~0#1| 0) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~count~0#1_38| Int) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_226 Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse5)) (< (+ |v_ULTIMATE.start_main_~count~0#1_38| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse5 2147483647)) (< .cse1 |v_ULTIMATE.start_main_~count~0#1_38|) (< (let ((.cse6 (select (store (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_225))) (store .cse9 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4)) v_ArrVal_226))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse8 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse7 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse6 (+ .cse7 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4))) (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)))) is different from false [2022-10-16 11:22:28,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= |c_ULTIMATE.start_main_~count~0#1| 0) (forall ((v_ArrVal_228 (Array Int Int)) (v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~count~0#1_38| Int) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (v_ArrVal_226 Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse0)) (< (+ |v_ULTIMATE.start_main_~count~0#1_38| 1) |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse0 2147483647)) (< .cse1 |v_ULTIMATE.start_main_~count~0#1_38|) (< (let ((.cse2 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4)) v_ArrVal_226)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_228))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))) (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)))) 2147483648)))) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (forall ((v_ArrVal_230 Int) (v_ArrVal_231 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_28| Int) (|v_ULTIMATE.start_main_~count~0#1_37| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~count~0#1_37| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (< 0 |v_ULTIMATE.start_main_~index~0#1_28|)) (< |v_ULTIMATE.start_main_~count~0#1_37| (+ |v_ULTIMATE.start_main_~index~0#1_28| 1)) (not (<= v_ArrVal_230 .cse6)) (< .cse1 |v_ULTIMATE.start_main_~count~0#1_37|) (not (<= .cse6 2147483647)) (< (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_37| 4)) v_ArrVal_230)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse8 (* 4 |v_ULTIMATE.start_main_~index~0#1_28|))) (+ (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))))) 2147483648)))) (<= (select .cse5 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4))) (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)))) is different from false [2022-10-16 11:22:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:22:39,968 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-10-16 11:22:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 11:22:39,969 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 45 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2022-10-16 11:22:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:22:39,970 INFO L225 Difference]: With dead ends: 118 [2022-10-16 11:22:39,970 INFO L226 Difference]: Without dead ends: 117 [2022-10-16 11:22:39,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=231, Invalid=1669, Unknown=20, NotChecked=630, Total=2550 [2022-10-16 11:22:39,973 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:22:39,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 698 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 340 Unchecked, 0.1s Time] [2022-10-16 11:22:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-16 11:22:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-10-16 11:22:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-10-16 11:22:39,983 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 54 [2022-10-16 11:22:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:22:39,983 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-10-16 11:22:39,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 45 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:22:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-10-16 11:22:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 11:22:39,985 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:22:39,985 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:22:40,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 11:22:40,185 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 11:22:40,186 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:22:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:22:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -9769728, now seen corresponding path program 1 times [2022-10-16 11:22:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:22:40,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112414726] [2022-10-16 11:22:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:22:40,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:22:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504661225] [2022-10-16 11:22:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:22:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:22:40,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:22:40,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:22:40,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 11:22:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:22:40,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-16 11:22:40,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:22:40,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:22:40,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:22:40,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-10-16 11:22:40,435 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 11:22:40,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-10-16 11:22:40,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-10-16 11:22:40,614 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 11:22:40,615 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 31 treesize of output 36 [2022-10-16 11:22:40,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-10-16 11:22:52,486 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~num~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~count~0#1_40| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_40| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|))) (and (<= |v_ULTIMATE.start_main_~count~0#1_40| 1) (<= 0 (+ .cse0 2147483648)) (<= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_3| (* |v_ULTIMATE.start_main_~count~0#1_40| 4))))))) (exists ((|ULTIMATE.start_main_~num~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~count~0#1_41| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_3| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|))) (and (<= 0 (select .cse1 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_41|) (<= (* |v_ULTIMATE.start_main_~count~0#1_41| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select .cse1 (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_3| (* |v_ULTIMATE.start_main_~count~0#1_41| 4)))) (<= |v_ULTIMATE.start_main_~count~0#1_41| 2))))) is different from true [2022-10-16 11:23:01,317 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 38 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:23:07,869 INFO L356 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2022-10-16 11:23:07,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 64 [2022-10-16 11:23:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:08,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:29,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~index~0#1_30| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_273 Int) (v_ArrVal_270 Int) (|v_ULTIMATE.start_main_~count~0#1_43| Int) (|v_ULTIMATE.start_main_~count~0#1_44| Int) (v_ArrVal_275 (Array Int Int))) (or (< 0 (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* |v_ULTIMATE.start_main_~count~0#1_44| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_270)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_272))) (store .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_43| 4)) v_ArrVal_273))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_30|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 4)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1))))) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_44|) (not (<= (* |v_ULTIMATE.start_main_~count~0#1_43| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) v_ArrVal_273)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_30|)) (< |v_ULTIMATE.start_main_~count~0#1_43| (+ |v_ULTIMATE.start_main_~index~0#1_30| 1)) (< (+ |v_ULTIMATE.start_main_~count~0#1_44| 1) |v_ULTIMATE.start_main_~count~0#1_43|))) is different from false [2022-10-16 11:23:29,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~index~0#1_30| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_273 Int) (v_ArrVal_270 Int) (|v_ULTIMATE.start_main_~count~0#1_43| Int) (|v_ULTIMATE.start_main_~count~0#1_44| Int) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_44|) (< 0 (let ((.cse0 (select (store (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_269))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* |v_ULTIMATE.start_main_~count~0#1_44| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_270))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_272))) (store .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_43| 4)) v_ArrVal_273))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_30|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 4))))) (not (<= (* |v_ULTIMATE.start_main_~count~0#1_43| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) v_ArrVal_273)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_30|)) (< |v_ULTIMATE.start_main_~count~0#1_43| (+ |v_ULTIMATE.start_main_~index~0#1_30| 1)) (< (+ |v_ULTIMATE.start_main_~count~0#1_44| 1) |v_ULTIMATE.start_main_~count~0#1_43|))) is different from false [2022-10-16 11:23:29,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:29,194 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 234 treesize of output 151 [2022-10-16 11:23:29,212 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 333 treesize of output 327 [2022-10-16 11:23:29,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:29,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:29,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:29,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 235 [2022-10-16 11:23:29,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:29,286 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 356 treesize of output 300 [2022-10-16 11:23:29,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:29,309 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 470 treesize of output 414 [2022-10-16 11:23:29,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:29,338 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 624 treesize of output 568 [2022-10-16 11:23:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-10-16 11:23:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:30,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112414726] [2022-10-16 11:23:30,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:30,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504661225] [2022-10-16 11:23:30,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504661225] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:30,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:30,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2022-10-16 11:23:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335284223] [2022-10-16 11:23:30,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:30,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 11:23:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 11:23:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1495, Unknown=47, NotChecked=246, Total=1980 [2022-10-16 11:23:30,756 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 45 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 44 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:32,792 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4)))) (forall ((|v_ULTIMATE.start_main_~index~0#1_30| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_273 Int) (v_ArrVal_270 Int) (|v_ULTIMATE.start_main_~count~0#1_43| Int) (|v_ULTIMATE.start_main_~count~0#1_44| Int) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_44|) (< 0 (let ((.cse0 (select (store (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_269))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* |v_ULTIMATE.start_main_~count~0#1_44| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_270))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_272))) (store .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_43| 4)) v_ArrVal_273))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_30|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 4))))) (not (<= (* |v_ULTIMATE.start_main_~count~0#1_43| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) v_ArrVal_273)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_30|)) (< |v_ULTIMATE.start_main_~count~0#1_43| (+ |v_ULTIMATE.start_main_~index~0#1_30| 1)) (< (+ |v_ULTIMATE.start_main_~count~0#1_44| 1) |v_ULTIMATE.start_main_~count~0#1_43|)))) is different from false [2022-10-16 11:23:34,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4)))) (forall ((|v_ULTIMATE.start_main_~index~0#1_30| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_273 Int) (v_ArrVal_270 Int) (|v_ULTIMATE.start_main_~count~0#1_43| Int) (|v_ULTIMATE.start_main_~count~0#1_44| Int) (v_ArrVal_275 (Array Int Int))) (or (< 0 (let ((.cse1 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~count~0#1_44| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_270)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_272))) (store .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_43| 4)) v_ArrVal_273))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (* 4 |v_ULTIMATE.start_main_~index~0#1_30|))) (+ 2147483649 (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse2 4)) (select .cse1 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse2))))) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_44|) (not (<= (* |v_ULTIMATE.start_main_~count~0#1_43| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) v_ArrVal_273)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_30|)) (< |v_ULTIMATE.start_main_~count~0#1_43| (+ |v_ULTIMATE.start_main_~index~0#1_30| 1)) (< (+ |v_ULTIMATE.start_main_~count~0#1_44| 1) |v_ULTIMATE.start_main_~count~0#1_43|))))) is different from false [2022-10-16 11:23:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:42,095 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-10-16 11:23:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 11:23:42,096 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 44 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-10-16 11:23:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:42,097 INFO L225 Difference]: With dead ends: 117 [2022-10-16 11:23:42,097 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 11:23:42,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=229, Invalid=1721, Unknown=50, NotChecked=450, Total=2450 [2022-10-16 11:23:42,099 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 505 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:42,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 829 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 505 Unchecked, 0.1s Time] [2022-10-16 11:23:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 11:23:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-10-16 11:23:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 109 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-10-16 11:23:42,111 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 55 [2022-10-16 11:23:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:42,112 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-10-16 11:23:42,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 44 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-10-16 11:23:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 11:23:42,113 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:42,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:42,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 11:23:42,327 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 11:23:42,327 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1433921488, now seen corresponding path program 2 times [2022-10-16 11:23:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989551560] [2022-10-16 11:23:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:42,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:42,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003229859] [2022-10-16 11:23:42,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:23:42,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:42,351 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:23:42,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 11:23:42,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 11:23:42,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:23:42,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:23:42,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 11:23:42,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 11:23:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989551560] [2022-10-16 11:23:42,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003229859] [2022-10-16 11:23:42,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003229859] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:23:42,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:23:42,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-10-16 11:23:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922591250] [2022-10-16 11:23:42,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:42,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 11:23:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 11:23:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:23:42,577 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:42,667 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-10-16 11:23:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:23:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-10-16 11:23:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:42,669 INFO L225 Difference]: With dead ends: 117 [2022-10-16 11:23:42,669 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 11:23:42,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-10-16 11:23:42,670 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 139 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:42,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 149 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:23:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 11:23:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-10-16 11:23:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-10-16 11:23:42,681 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 57 [2022-10-16 11:23:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:42,682 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-10-16 11:23:42,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-10-16 11:23:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 11:23:42,683 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:42,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-10-16 11:23:42,725 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 11:23:42,897 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 11:23:42,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2065259611, now seen corresponding path program 1 times [2022-10-16 11:23:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691508339] [2022-10-16 11:23:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:42,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:42,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882263172] [2022-10-16 11:23:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:42,916 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:23:42,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 11:23:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:42,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 11:23:42,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:43,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:23:43,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:23:43,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:23:43,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:23:43,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:23:43,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:23:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:23:43,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:23:44,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-16 11:23:44,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:23:44,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:44,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:44,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:44,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 19 [2022-10-16 11:23:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:44,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:44,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~index~0#1| 4))) (+ (select .cse0 (+ (- 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1 4)))) 2147483648)) is different from false [2022-10-16 11:23:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691508339] [2022-10-16 11:23:44,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882263172] [2022-10-16 11:23:44,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882263172] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:23:44,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:23:44,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-10-16 11:23:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790148954] [2022-10-16 11:23:44,529 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:44,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 11:23:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 11:23:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=624, Unknown=1, NotChecked=50, Total=756 [2022-10-16 11:23:44,530 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:45,684 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-10-16 11:23:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 11:23:45,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2022-10-16 11:23:45,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:45,686 INFO L225 Difference]: With dead ends: 119 [2022-10-16 11:23:45,686 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 11:23:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=1122, Unknown=1, NotChecked=68, Total=1332 [2022-10-16 11:23:45,687 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 61 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 359 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 618 Invalid, 0 Unknown, 110 Unchecked, 0.7s Time] [2022-10-16 11:23:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 11:23:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2022-10-16 11:23:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 105 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2022-10-16 11:23:45,699 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 60 [2022-10-16 11:23:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:45,700 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2022-10-16 11:23:45,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-10-16 11:23:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 11:23:45,701 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:45,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-10-16 11:23:45,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 11:23:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:45,915 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 401461606, now seen corresponding path program 1 times [2022-10-16 11:23:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:45,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565094147] [2022-10-16 11:23:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:45,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44788203] [2022-10-16 11:23:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:45,935 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:23:45,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 11:23:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:23:46,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 11:23:46,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:46,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:23:46,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:23:46,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-10-16 11:23:46,219 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 32 treesize of output 31 [2022-10-16 11:23:46,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:23:46,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:23:46,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:23:47,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-16 11:23:47,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:23:47,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:47,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:23:47,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:23:47,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 21 [2022-10-16 11:23:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:23:47,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:23:47,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int))) (< 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~index~0#1| 4))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1 4)) (select .cse0 (+ (- 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse1)))))) is different from false [2022-10-16 11:23:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:23:47,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565094147] [2022-10-16 11:23:47,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:23:47,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44788203] [2022-10-16 11:23:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44788203] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:23:47,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:23:47,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-10-16 11:23:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655968199] [2022-10-16 11:23:47,615 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:23:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 11:23:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:23:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 11:23:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=624, Unknown=1, NotChecked=50, Total=756 [2022-10-16 11:23:47,617 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:23:48,756 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2022-10-16 11:23:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 11:23:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-10-16 11:23:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:23:48,759 INFO L225 Difference]: With dead ends: 157 [2022-10-16 11:23:48,759 INFO L226 Difference]: Without dead ends: 156 [2022-10-16 11:23:48,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=1243, Unknown=1, NotChecked=72, Total=1482 [2022-10-16 11:23:48,760 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 120 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 11:23:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 503 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 699 Invalid, 0 Unknown, 120 Unchecked, 0.6s Time] [2022-10-16 11:23:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-10-16 11:23:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-10-16 11:23:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.134020618556701) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 11:23:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-10-16 11:23:48,773 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 61 [2022-10-16 11:23:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:23:48,773 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-10-16 11:23:48,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:23:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-10-16 11:23:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 11:23:48,774 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:23:48,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:23:48,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 11:23:48,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:48,987 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:23:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:23:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1155652489, now seen corresponding path program 3 times [2022-10-16 11:23:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:23:48,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286180799] [2022-10-16 11:23:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:23:48,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:23:49,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:23:49,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620371222] [2022-10-16 11:23:49,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 11:23:49,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:23:49,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:23:49,002 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:23:49,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 11:23:49,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 11:23:49,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:23:49,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-16 11:23:49,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:23:49,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:23:49,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:23:49,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-10-16 11:23:49,445 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 11:23:49,450 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 30 treesize of output 37 [2022-10-16 11:23:49,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 11:23:50,055 INFO L356 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-10-16 11:23:50,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2022-10-16 11:23:50,220 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 54 treesize of output 52 [2022-10-16 11:23:51,330 INFO L356 Elim1Store]: treesize reduction 49, result has 27.9 percent of original size [2022-10-16 11:23:51,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 68 [2022-10-16 11:23:51,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-10-16 11:24:10,001 INFO L356 Elim1Store]: treesize reduction 261, result has 62.1 percent of original size [2022-10-16 11:24:10,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 125 treesize of output 465 [2022-10-16 11:24:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:24:12,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:24:19,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 Int) (v_ArrVal_471 Int) (|v_ULTIMATE.start_main_~index~0#1_34| Int) (|v_ULTIMATE.start_main_~count~0#1_65| Int) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (let ((.cse0 (* |v_ULTIMATE.start_main_~count~0#1_65| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (let ((.cse2 (+ .cse0 .cse1))) (or (not (<= v_ArrVal_477 (+ .cse0 (* 2 .cse1)))) (not (<= v_ArrVal_475 .cse2)) (not (< (+ |v_ULTIMATE.start_main_~count~0#1_65| 2) c_~ARR_SIZE~0)) (not (< (+ |v_ULTIMATE.start_main_~index~0#1_34| 1) c_~ARR_SIZE~0)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~count~0#1_65|) (not (<= .cse2 2147483647)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_34|)) (not (<= v_ArrVal_471 .cse0)) (< (let ((.cse3 (select (store (let ((.cse6 (* |v_ULTIMATE.start_main_~count~0#1_65| 4))) (let ((.cse5 (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_471)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_473))) (store .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_475))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_476))) (store .cse5 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset| 8) v_ArrVal_477)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse4 (* 4 |v_ULTIMATE.start_main_~index~0#1_34|))) (+ (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4))))) 2147483648) (< (+ |v_ULTIMATE.start_main_~count~0#1_65| 3) c_~ARR_SIZE~0))))) is different from false [2022-10-16 11:24:20,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,377 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 479 treesize of output 300 [2022-10-16 11:24:20,408 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 693 treesize of output 687 [2022-10-16 11:24:20,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:20,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:24:20,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2144 treesize of output 1886 [2022-10-16 11:24:20,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,556 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 2187 treesize of output 2075 [2022-10-16 11:24:20,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,616 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 2391 treesize of output 2279 [2022-10-16 11:24:20,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,684 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 4053 treesize of output 3829 [2022-10-16 11:24:20,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:24:20,792 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 8238 treesize of output 7790 [2022-10-16 11:24:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-10-16 11:24:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:24:23,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286180799] [2022-10-16 11:24:23,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:24:23,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620371222] [2022-10-16 11:24:23,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620371222] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:24:23,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 11:24:23,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2022-10-16 11:24:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344580821] [2022-10-16 11:24:23,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 11:24:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-10-16 11:24:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:24:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-10-16 11:24:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2646, Unknown=39, NotChecked=106, Total=3080 [2022-10-16 11:24:23,048 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 56 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 55 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 11:25:14,032 WARN L233 SmtUtils]: Spent 37.52s on a formula simplification. DAG size of input: 169 DAG size of output: 145 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:25:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:25:56,870 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2022-10-16 11:25:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-16 11:25:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 55 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 64 [2022-10-16 11:25:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:25:56,873 INFO L225 Difference]: With dead ends: 172 [2022-10-16 11:25:56,873 INFO L226 Difference]: Without dead ends: 171 [2022-10-16 11:25:56,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 118.2s TimeCoverageRelationStatistics Valid=661, Invalid=5725, Unknown=98, NotChecked=158, Total=6642 [2022-10-16 11:25:56,876 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 35 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:25:56,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 704 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 470 Unchecked, 0.0s Time] [2022-10-16 11:25:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-10-16 11:25:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2022-10-16 11:25:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 154 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 11:25:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 170 transitions. [2022-10-16 11:25:56,899 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 170 transitions. Word has length 64 [2022-10-16 11:25:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:25:56,899 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 170 transitions. [2022-10-16 11:25:56,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 55 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 11:25:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 170 transitions. [2022-10-16 11:25:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 11:25:56,900 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:25:56,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-10-16 11:25:56,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-10-16 11:25:57,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 11:25:57,109 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:25:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:25:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash -529632722, now seen corresponding path program 1 times [2022-10-16 11:25:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:25:57,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710726344] [2022-10-16 11:25:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:25:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:25:57,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:25:57,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098076243] [2022-10-16 11:25:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:25:57,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:25:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:25:57,125 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:25:57,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 11:25:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:25:57,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 11:25:57,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:25:57,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:25:57,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:25:57,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-10-16 11:25:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:25:57,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:25:57,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:25:57,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:25:57,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:25:57,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:25:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:25:57,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:25:57,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:25:58,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 11:25:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:25:58,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:25:58,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int))) (< (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 9223372036854775808)) is different from false [2022-10-16 11:25:58,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_534 (Array Int Int))) (< (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~index~0#1| 4)) v_ArrVal_533)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) 9223372036854775808)) is different from false [2022-10-16 11:25:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:25:58,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710726344] [2022-10-16 11:25:58,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 11:25:58,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098076243] [2022-10-16 11:25:58,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098076243] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:25:58,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:25:58,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-10-16 11:25:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619390393] [2022-10-16 11:25:58,190 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-16 11:25:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 11:25:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:25:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 11:25:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=232, Unknown=2, NotChecked=66, Total=380 [2022-10-16 11:25:58,193 INFO L87 Difference]: Start difference. First operand 163 states and 170 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:25:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:25:58,541 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2022-10-16 11:25:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 11:25:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-10-16 11:25:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:25:58,543 INFO L225 Difference]: With dead ends: 204 [2022-10-16 11:25:58,546 INFO L226 Difference]: Without dead ends: 203 [2022-10-16 11:25:58,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=350, Unknown=2, NotChecked=82, Total=552 [2022-10-16 11:25:58,552 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:25:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 226 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-10-16 11:25:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-16 11:25:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 189. [2022-10-16 11:25:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.125) internal successors, (189), 178 states have internal predecessors, (189), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-16 11:25:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2022-10-16 11:25:58,585 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 65 [2022-10-16 11:25:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:25:58,585 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2022-10-16 11:25:58,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 11:25:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2022-10-16 11:25:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 11:25:58,586 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:25:58,587 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 11:25:58,611 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 11:25:58,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:25:58,792 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-10-16 11:25:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:25:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1465488886, now seen corresponding path program 2 times [2022-10-16 11:25:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:25:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394631421] [2022-10-16 11:25:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:25:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:25:58,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 11:25:58,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553361262] [2022-10-16 11:25:58,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:25:58,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:25:58,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:25:58,810 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:25:58,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 11:25:58,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:25:58,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:25:58,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-16 11:25:58,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:25:58,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 11:25:58,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:25:58,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-10-16 11:25:59,116 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:25:59,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:25:59,181 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 28 treesize of output 28 [2022-10-16 11:25:59,403 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-10-16 11:25:59,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-10-16 11:25:59,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-10-16 11:25:59,771 INFO L356 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-10-16 11:25:59,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-10-16 11:25:59,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-10-16 11:26:01,081 INFO L356 Elim1Store]: treesize reduction 42, result has 49.4 percent of original size [2022-10-16 11:26:01,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 59 [2022-10-16 11:26:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:26:01,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:26:03,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_36| Int)) (or (< |c_ULTIMATE.start_main_#t~post5#1| |v_ULTIMATE.start_main_~index~0#1_36|) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (not (<= (+ (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_587)) (< 0 (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post5#1| 4) |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_587)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse1))))))) is different from false [2022-10-16 11:26:03,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_36| Int)) (or (< |c_ULTIMATE.start_main_~count~0#1| |v_ULTIMATE.start_main_~index~0#1_36|) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_587)) (< 0 (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4) 4) v_ArrVal_587)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1))))))) is different from false [2022-10-16 11:26:03,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~index~0#1_36| Int) (v_ArrVal_586 (Array Int Int))) (or (< 0 (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_586))) (store .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~count~0#1| 4) 4) v_ArrVal_587))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse1))))) (< |c_ULTIMATE.start_main_~count~0#1| |v_ULTIMATE.start_main_~index~0#1_36|) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (not (<= (+ (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) v_ArrVal_587)))) is different from false [2022-10-16 11:26:03,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_585 Int) (|v_ULTIMATE.start_main_~index~0#1_36| Int) (v_ArrVal_586 (Array Int Int))) (let ((.cse0 (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (<= (+ .cse0 .cse1) v_ArrVal_585)) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (< 0 (let ((.cse2 (select (store (let ((.cse5 (* |c_ULTIMATE.start_main_#t~post5#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_585)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_586))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 8) v_ArrVal_587)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse3)) 2147483649 (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse3))))) (not (<= (+ .cse0 (* 2 .cse1)) v_ArrVal_587)) (< (+ |c_ULTIMATE.start_main_#t~post5#1| 1) |v_ULTIMATE.start_main_~index~0#1_36|)))) is different from false [2022-10-16 11:26:14,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_585 Int) (|v_ULTIMATE.start_main_~index~0#1_36| Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (let ((.cse5 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse6 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (< 0 (let ((.cse0 (select (store (let ((.cse3 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (let ((.cse2 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_583))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3 4) v_ArrVal_585))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_586))) (store .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse3 8) v_ArrVal_587)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ 2147483649 (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse1)) (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse1))))) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) |v_ULTIMATE.start_main_~index~0#1_36|) (not (<= (+ .cse5 .cse6) v_ArrVal_585)) (not (<= (+ .cse5 (* 2 .cse6)) v_ArrVal_587))))) is different from false [2022-10-16 11:26:15,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 Int) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_581 Int) (|v_ULTIMATE.start_main_~index~0#1_36| Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (let ((.cse0 (* |c_ULTIMATE.start_main_#t~post5#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))) (or (not (<= (+ .cse0 .cse1) v_ArrVal_581)) (< (+ 2 |c_ULTIMATE.start_main_#t~post5#1|) |v_ULTIMATE.start_main_~index~0#1_36|) (not (< 0 |v_ULTIMATE.start_main_~index~0#1_36|)) (not (<= (+ .cse0 (* 2 .cse1)) v_ArrVal_585)) (< 0 (let ((.cse2 (select (store (let ((.cse5 (* |c_ULTIMATE.start_main_#t~post5#1| 4))) (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 4) v_ArrVal_581)) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_583))) (store .cse6 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 8) v_ArrVal_585))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_586))) (store .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset| 12) v_ArrVal_587)))) |c_ULTIMATE.start_main_~#array2~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (* 4 |v_ULTIMATE.start_main_~index~0#1_36|))) (+ 2147483649 (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (- 4) .cse3)) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4 .cse3))))) (not (<= (+ .cse0 (* 3 .cse1)) v_ArrVal_587))))) is different from false [2022-10-16 11:26:18,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:26:18,006 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 488 treesize of output 309 [2022-10-16 11:26:18,033 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 713 treesize of output 707 [2022-10-16 11:26:18,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:18,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:18,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2268 treesize of output 1988 [2022-10-16 11:26:18,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2336 treesize of output 2224 [2022-10-16 11:26:18,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:18,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2300 treesize of output 2216 [2022-10-16 11:26:18,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:18,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:26:18,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2362 treesize of output 2292 [2022-10-16 11:26:18,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:26:18,337 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 115257 treesize of output 108111