./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s22if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s22if.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:14:33,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:14:33,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:14:33,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:14:33,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:14:33,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:14:33,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:14:33,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:14:33,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:14:33,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:14:33,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:14:33,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:14:33,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:14:33,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:14:33,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:14:33,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:14:33,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:14:33,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:14:33,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:14:33,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:14:33,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:14:33,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:14:33,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:14:33,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:14:33,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:14:33,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:14:33,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:14:33,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:14:33,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:14:33,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:14:33,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:14:33,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:14:33,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:14:33,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:14:33,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:14:33,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:14:33,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:14:33,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:14:33,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:14:33,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:14:33,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:14:33,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:14:33,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:14:33,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:14:33,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:14:33,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:14:33,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:14:33,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:14:33,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:14:33,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:14:33,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:14:33,615 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:14:33,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:14:33,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:14:33,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:14:33,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:14:33,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:14:33,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:14:33,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:14:33,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:14:33,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:14:33,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:14:33,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:14:33,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:14:33,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:14:33,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:14:33,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:14:33,620 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:14:33,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:14:33,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:14:33,620 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a4adccbfdb287a751e5c33c3e59569f71741de562bf1a42797adb485c4a44d2 [2022-07-13 11:14:33,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:14:33,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:14:33,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:14:33,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:14:33,820 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:14:33,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s22if.c [2022-07-13 11:14:33,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a328c8a/41636391b72a46dc84b48c4d76a4e0bb/FLAGb72de8583 [2022-07-13 11:14:34,202 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:14:34,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c [2022-07-13 11:14:34,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a328c8a/41636391b72a46dc84b48c4d76a4e0bb/FLAGb72de8583 [2022-07-13 11:14:34,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a328c8a/41636391b72a46dc84b48c4d76a4e0bb [2022-07-13 11:14:34,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:14:34,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:14:34,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:14:34,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:14:34,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:14:34,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9dc68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34, skipping insertion in model container [2022-07-13 11:14:34,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:14:34,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:14:34,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c[588,601] [2022-07-13 11:14:34,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:14:34,437 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:14:34,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c[588,601] [2022-07-13 11:14:34,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:14:34,479 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:14:34,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34 WrapperNode [2022-07-13 11:14:34,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:14:34,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:14:34,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:14:34,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:14:34,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,502 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2022-07-13 11:14:34,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:14:34,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:14:34,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:14:34,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:14:34,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:14:34,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:14:34,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:14:34,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:14:34,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (1/1) ... [2022-07-13 11:14:34,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:14:34,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:34,541 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-07-13 11:14:34,543 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-07-13 11:14:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:14:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:14:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:14:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:14:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:14:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:14:34,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:14:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:14:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:14:34,614 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:14:34,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:14:34,707 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:14:34,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:14:34,711 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:14:34,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:14:34 BoogieIcfgContainer [2022-07-13 11:14:34,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:14:34,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:14:34,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:14:34,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:14:34,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:14:34" (1/3) ... [2022-07-13 11:14:34,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cba75fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:14:34, skipping insertion in model container [2022-07-13 11:14:34,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:14:34" (2/3) ... [2022-07-13 11:14:34,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cba75fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:14:34, skipping insertion in model container [2022-07-13 11:14:34,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:14:34" (3/3) ... [2022-07-13 11:14:34,718 INFO L111 eAbstractionObserver]: Analyzing ICFG s22if.c [2022-07-13 11:14:34,727 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:14:34,727 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:14:34,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:14:34,760 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cb1fe5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6dd3f0bd [2022-07-13 11:14:34,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:14:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:14:34,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:34,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:34,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2022-07-13 11:14:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:34,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944395009] [2022-07-13 11:14:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:14:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:34,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944395009] [2022-07-13 11:14:34,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944395009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:14:34,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:14:34,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:14:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117038731] [2022-07-13 11:14:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:14:34,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:14:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:14:34,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:14:34,911 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:34,926 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-13 11:14:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:14:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:14:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:34,933 INFO L225 Difference]: With dead ends: 42 [2022-07-13 11:14:34,933 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 11:14:34,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:14:34,944 INFO L413 NwaCegarLoop]: 28 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, 28 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-07-13 11:14:34,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:14:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 11:14:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 11:14:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-13 11:14:34,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2022-07-13 11:14:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:34,967 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-13 11:14:34,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-13 11:14:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:14:34,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:34,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:34,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:14:34,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2022-07-13 11:14:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129213548] [2022-07-13 11:14:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:14:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129213548] [2022-07-13 11:14:35,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129213548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:14:35,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:14:35,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:14:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567663710] [2022-07-13 11:14:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:14:35,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:14:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:14:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:14:35,079 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:35,131 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-07-13 11:14:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:14:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:14:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:35,132 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:14:35,132 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 11:14:35,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:14:35,134 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:35,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:14:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 11:14:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 11:14:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 11:14:35,145 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-13 11:14:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:35,145 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 11:14:35,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 11:14:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:14:35,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:35,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:35,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:14:35,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2022-07-13 11:14:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:35,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376060254] [2022-07-13 11:14:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:35,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376060254] [2022-07-13 11:14:35,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376060254] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385876012] [2022-07-13 11:14:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:35,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:35,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:35,480 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-07-13 11:14:35,493 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-07-13 11:14:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:35,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:14:35,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:35,621 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-07-13 11:14:35,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:14:35,662 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-07-13 11:14:35,725 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-07-13 11:14:35,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:14:35,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-13 11:14:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:35,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:36,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse2 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (let ((.cse1 (* c_~N~0 3)) (.cse0 (+ .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse2 3))))) is different from false [2022-07-13 11:14:36,214 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:14:36,214 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 28 treesize of output 1 [2022-07-13 11:14:36,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:36,221 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 28 treesize of output 29 [2022-07-13 11:14:36,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:14:36,225 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 26 treesize of output 18 [2022-07-13 11:14:36,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 11:14:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 11:14:36,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385876012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:36,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:36,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-13 11:14:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636020469] [2022-07-13 11:14:36,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:36,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:14:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:36,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:14:36,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=244, Unknown=2, NotChecked=32, Total=342 [2022-07-13 11:14:36,240 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:36,469 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-13 11:14:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:14:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:14:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:36,471 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:14:36,471 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:14:36,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=418, Unknown=2, NotChecked=44, Total=600 [2022-07-13 11:14:36,472 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:36,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2022-07-13 11:14:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:14:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-13 11:14:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-13 11:14:36,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-13 11:14:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:36,477 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 11:14:36,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-13 11:14:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:14:36,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:36,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:36,499 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-07-13 11:14:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:36,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2022-07-13 11:14:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:36,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143693435] [2022-07-13 11:14:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:36,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:14:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140750535] [2022-07-13 11:14:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:36,738 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-07-13 11:14:36,739 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-07-13 11:14:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:36,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:14:36,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:36,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-13 11:14:36,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-13 11:14:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:36,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:36,874 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 37 treesize of output 31 [2022-07-13 11:14:36,879 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:14:36,880 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 44 treesize of output 30 [2022-07-13 11:14:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143693435] [2022-07-13 11:14:36,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:14:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140750535] [2022-07-13 11:14:36,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140750535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:36,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:14:36,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-07-13 11:14:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191406204] [2022-07-13 11:14:36,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:14:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:14:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:14:36,893 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:37,026 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-13 11:14:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:14:37,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:14:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:37,030 INFO L225 Difference]: With dead ends: 58 [2022-07-13 11:14:37,030 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:14:37,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:14:37,034 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:37,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:14:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-07-13 11:14:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-13 11:14:37,052 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2022-07-13 11:14:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:37,052 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-13 11:14:37,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-07-13 11:14:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:14:37,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:37,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:37,095 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-07-13 11:14:37,271 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,SelfDestructingSolverStorable3 [2022-07-13 11:14:37,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2022-07-13 11:14:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:37,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868814839] [2022-07-13 11:14:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:37,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868814839] [2022-07-13 11:14:37,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868814839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:37,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916718213] [2022-07-13 11:14:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:37,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:37,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:37,462 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-07-13 11:14:37,484 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-07-13 11:14:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:37,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:14:37,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:37,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:14:37,564 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-07-13 11:14:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:37,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:37,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-13 11:14:37,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-13 11:14:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:37,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916718213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:37,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:37,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-13 11:14:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063881383] [2022-07-13 11:14:37,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:14:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:14:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:14:37,610 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:38,054 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-07-13 11:14:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:14:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:14:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:38,055 INFO L225 Difference]: With dead ends: 86 [2022-07-13 11:14:38,055 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:14:38,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 11:14:38,057 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:38,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:14:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-07-13 11:14:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-13 11:14:38,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2022-07-13 11:14:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:38,062 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-13 11:14:38,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-13 11:14:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:14:38,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:38,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:38,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 11:14:38,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:38,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2022-07-13 11:14:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123663336] [2022-07-13 11:14:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123663336] [2022-07-13 11:14:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123663336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733728638] [2022-07-13 11:14:38,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:14:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:38,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:38,322 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-07-13 11:14:38,343 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-07-13 11:14:38,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:14:38,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:38,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:14:38,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733728638] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:38,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:38,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:14:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026464081] [2022-07-13 11:14:38,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:38,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:14:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:14:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:14:38,444 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:38,563 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-07-13 11:14:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:14:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 11:14:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:38,564 INFO L225 Difference]: With dead ends: 85 [2022-07-13 11:14:38,564 INFO L226 Difference]: Without dead ends: 75 [2022-07-13 11:14:38,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:14:38,565 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:38,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 26 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-13 11:14:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-07-13 11:14:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-07-13 11:14:38,569 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2022-07-13 11:14:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:38,570 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-07-13 11:14:38,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-07-13 11:14:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:14:38,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:38,570 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-07-13 11:14:38,589 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-07-13 11:14:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:38,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2022-07-13 11:14:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:38,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111292935] [2022-07-13 11:14:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111292935] [2022-07-13 11:14:38,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111292935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:38,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961389563] [2022-07-13 11:14:38,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:14:38,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:38,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:38,861 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-07-13 11:14:38,862 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-07-13 11:14:38,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:14:38,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:38,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:14:38,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:14:38,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961389563] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:38,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:38,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:14:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982413636] [2022-07-13 11:14:38,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:14:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:14:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:14:38,978 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:39,061 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-07-13 11:14:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:14:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:14:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:39,062 INFO L225 Difference]: With dead ends: 78 [2022-07-13 11:14:39,062 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:14:39,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:14:39,063 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:39,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:14:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-07-13 11:14:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-13 11:14:39,066 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2022-07-13 11:14:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:39,067 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-13 11:14:39,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-13 11:14:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:14:39,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:39,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:39,089 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-07-13 11:14:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:39,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2022-07-13 11:14:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311784580] [2022-07-13 11:14:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:14:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:39,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311784580] [2022-07-13 11:14:39,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311784580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80462332] [2022-07-13 11:14:39,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:14:39,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:39,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:39,551 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-07-13 11:14:39,552 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-07-13 11:14:39,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:14:39,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:39,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:14:39,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:39,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:14:39,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,636 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-07-13 11:14:39,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,664 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-07-13 11:14:39,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,744 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-07-13 11:14:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,767 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-07-13 11:14:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:14:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,904 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:14:39,904 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-13 11:14:39,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:39,979 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:14:39,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-07-13 11:14:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:40,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:40,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (let ((.cse3 (+ .cse4 .cse0 .cse1)) (.cse2 (* c_~N~0 3))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2022-07-13 11:14:40,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= 3 .cse0)) (let ((.cse2 (* 3 ~N~0)) (.cse1 (+ .cse3 .cse4 .cse0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse3 3)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:14:41,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= 3 .cse0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (let ((.cse2 (* 3 ~N~0)) (.cse1 (+ .cse3 .cse4 .cse0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse3 3)))))))) is different from false [2022-07-13 11:14:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-07-13 11:14:41,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80462332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:41,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:41,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2022-07-13 11:14:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409339299] [2022-07-13 11:14:41,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:41,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 11:14:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 11:14:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=763, Unknown=4, NotChecked=174, Total=1056 [2022-07-13 11:14:41,428 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:42,015 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-07-13 11:14:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 11:14:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:14:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:42,017 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:14:42,017 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:14:42,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1457, Unknown=4, NotChecked=246, Total=1980 [2022-07-13 11:14:42,018 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:42,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 122 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 331 Invalid, 0 Unknown, 463 Unchecked, 0.2s Time] [2022-07-13 11:14:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:14:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2022-07-13 11:14:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-07-13 11:14:42,038 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2022-07-13 11:14:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:42,040 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-07-13 11:14:42,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-07-13 11:14:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:14:42,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:42,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:42,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 11:14:42,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:42,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2022-07-13 11:14:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:42,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768212894] [2022-07-13 11:14:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:42,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:14:42,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162782978] [2022-07-13 11:14:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:42,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:42,268 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-07-13 11:14:42,285 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-07-13 11:14:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:42,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 11:14:42,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:14:42,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:42,407 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 18 treesize of output 20 [2022-07-13 11:14:42,425 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 21 treesize of output 9 [2022-07-13 11:14:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:14:42,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:42,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-13 11:14:42,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-13 11:14:42,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:42,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-07-13 11:14:42,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:42,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2022-07-13 11:14:42,495 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 13 treesize of output 9 [2022-07-13 11:14:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-13 11:14:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768212894] [2022-07-13 11:14:42,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:14:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162782978] [2022-07-13 11:14:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162782978] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:42,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:14:42,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-13 11:14:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670566288] [2022-07-13 11:14:42,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:42,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:14:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:14:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2022-07-13 11:14:42,541 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:42,720 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2022-07-13 11:14:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:14:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:14:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:42,721 INFO L225 Difference]: With dead ends: 112 [2022-07-13 11:14:42,721 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 11:14:42,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2022-07-13 11:14:42,721 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:42,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 86 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 225 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-07-13 11:14:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 11:14:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2022-07-13 11:14:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-07-13 11:14:42,729 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 29 [2022-07-13 11:14:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:42,729 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-13 11:14:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-07-13 11:14:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:14:42,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:42,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:42,748 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-07-13 11:14:42,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:42,949 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2022-07-13 11:14:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:42,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764843397] [2022-07-13 11:14:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:42,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:14:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723162001] [2022-07-13 11:14:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:42,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:42,964 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-07-13 11:14:42,965 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-07-13 11:14:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:43,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:14:43,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:43,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:14:43,047 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:14:43,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:14:43,058 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 19 treesize of output 7 [2022-07-13 11:14:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:43,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:43,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-13 11:14:43,085 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 28 treesize of output 24 [2022-07-13 11:14:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764843397] [2022-07-13 11:14:43,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:14:43,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723162001] [2022-07-13 11:14:43,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723162001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:43,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:14:43,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-13 11:14:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919677153] [2022-07-13 11:14:43,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:14:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:14:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:14:43,092 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:43,189 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2022-07-13 11:14:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:14:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:14:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:43,190 INFO L225 Difference]: With dead ends: 123 [2022-07-13 11:14:43,190 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 11:14:43,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:14:43,191 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:43,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 11:14:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-07-13 11:14:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2022-07-13 11:14:43,197 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 29 [2022-07-13 11:14:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:43,198 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2022-07-13 11:14:43,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-07-13 11:14:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:14:43,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:43,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:43,215 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-07-13 11:14:43,412 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,SelfDestructingSolverStorable9 [2022-07-13 11:14:43,412 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2022-07-13 11:14:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501321175] [2022-07-13 11:14:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501321175] [2022-07-13 11:14:43,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501321175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167374262] [2022-07-13 11:14:43,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:14:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:43,477 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-07-13 11:14:43,494 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-07-13 11:14:43,545 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:14:43,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:43,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:14:43,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:43,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167374262] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:43,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:43,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:14:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883699781] [2022-07-13 11:14:43,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:43,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:14:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:43,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:14:43,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:14:43,631 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:43,822 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-13 11:14:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:14:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 11:14:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:43,823 INFO L225 Difference]: With dead ends: 110 [2022-07-13 11:14:43,823 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 11:14:43,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:14:43,823 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:43,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 34 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 11:14:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-07-13 11:14:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-07-13 11:14:43,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2022-07-13 11:14:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:43,830 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-07-13 11:14:43,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-07-13 11:14:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:14:43,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:43,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:43,847 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-07-13 11:14:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:44,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2022-07-13 11:14:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402983736] [2022-07-13 11:14:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:44,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402983736] [2022-07-13 11:14:44,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402983736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:44,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195076387] [2022-07-13 11:14:44,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:14:44,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:44,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:44,097 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-07-13 11:14:44,115 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-07-13 11:14:44,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:14:44,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:44,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:14:44,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:44,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:14:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195076387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:44,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:14:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038603579] [2022-07-13 11:14:44,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:44,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:14:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:14:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:14:44,275 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:44,375 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-07-13 11:14:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:14:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 11:14:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:44,376 INFO L225 Difference]: With dead ends: 101 [2022-07-13 11:14:44,376 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:14:44,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:14:44,377 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:44,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:14:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-13 11:14:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-13 11:14:44,381 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2022-07-13 11:14:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:44,381 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-13 11:14:44,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-13 11:14:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:14:44,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:44,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:44,414 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-07-13 11:14:44,614 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,SelfDestructingSolverStorable11 [2022-07-13 11:14:44,614 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2022-07-13 11:14:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:44,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236771889] [2022-07-13 11:14:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:14:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236771889] [2022-07-13 11:14:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236771889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822343637] [2022-07-13 11:14:44,869 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:14:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:44,887 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-07-13 11:14:44,888 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-07-13 11:14:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:44,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 11:14:44,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:44,968 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-07-13 11:14:44,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:14:44,978 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-07-13 11:14:44,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:14:44,999 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-07-13 11:14:45,048 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-07-13 11:14:45,064 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-07-13 11:14:45,080 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-07-13 11:14:45,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:14:45,214 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:14:45,214 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 1 case distinctions, treesize of input 59 treesize of output 41 [2022-07-13 11:14:45,305 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:14:45,305 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 1 case distinctions, treesize of input 61 treesize of output 43 [2022-07-13 11:14:45,371 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:14:45,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 36 [2022-07-13 11:14:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:14:45,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:51,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (not (= .cse2 3)) (let ((.cse4 (+ .cse1 .cse2 .cse0 .cse5)) (.cse3 (* c_~N~0 3))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2022-07-13 11:14:54,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 3 .cse4))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:14:54,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 3 .cse4))))))))) is different from false [2022-07-13 11:14:56,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (let ((.cse3 (* 3 ~N~0)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 3 .cse4))))))))) is different from false [2022-07-13 11:14:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-07-13 11:14:57,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822343637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:57,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:57,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 38 [2022-07-13 11:14:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855353774] [2022-07-13 11:14:57,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 11:14:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 11:14:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1005, Unknown=9, NotChecked=268, Total=1406 [2022-07-13 11:14:57,240 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:57,915 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-07-13 11:14:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 11:14:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:14:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:57,916 INFO L225 Difference]: With dead ends: 94 [2022-07-13 11:14:57,916 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 11:14:57,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=249, Invalid=1828, Unknown=9, NotChecked=364, Total=2450 [2022-07-13 11:14:57,917 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:57,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 126 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 356 Invalid, 0 Unknown, 626 Unchecked, 0.2s Time] [2022-07-13 11:14:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 11:14:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2022-07-13 11:14:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-07-13 11:14:57,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2022-07-13 11:14:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:57,923 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-07-13 11:14:57,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-07-13 11:14:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:14:57,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:57,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:57,940 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-07-13 11:14:58,128 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,SelfDestructingSolverStorable12 [2022-07-13 11:14:58,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2022-07-13 11:14:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:58,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826062074] [2022-07-13 11:14:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:58,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:14:58,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984432118] [2022-07-13 11:14:58,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:14:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:58,157 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-07-13 11:14:58,158 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-07-13 11:14:58,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:14:58,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:58,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 11:14:58,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:58,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:14:58,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:58,389 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 18 treesize of output 20 [2022-07-13 11:14:58,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:58,421 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 18 treesize of output 20 [2022-07-13 11:14:58,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:58,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 11:14:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:14:58,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:58,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2022-07-13 11:14:58,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2022-07-13 11:14:58,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:58,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-07-13 11:14:58,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:58,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2022-07-13 11:14:58,737 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 13 treesize of output 7 [2022-07-13 11:14:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-13 11:14:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:59,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826062074] [2022-07-13 11:14:59,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:14:59,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984432118] [2022-07-13 11:14:59,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984432118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:59,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:14:59,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-07-13 11:14:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224456001] [2022-07-13 11:14:59,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:59,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 11:14:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 11:14:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=796, Unknown=12, NotChecked=122, Total=1122 [2022-07-13 11:14:59,008 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:59,422 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-13 11:14:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:14:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:14:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:59,423 INFO L225 Difference]: With dead ends: 106 [2022-07-13 11:14:59,423 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 11:14:59,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=1343, Unknown=13, NotChecked=162, Total=1892 [2022-07-13 11:14:59,424 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:59,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 47 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 345 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-07-13 11:14:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 11:14:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2022-07-13 11:14:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-13 11:14:59,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 37 [2022-07-13 11:14:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:59,431 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-13 11:14:59,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-13 11:14:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:14:59,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:59,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:59,449 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-07-13 11:14:59,649 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,SelfDestructingSolverStorable13 [2022-07-13 11:14:59,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2022-07-13 11:14:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049824164] [2022-07-13 11:14:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:59,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:14:59,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090399627] [2022-07-13 11:14:59,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:14:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:59,686 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-07-13 11:14:59,687 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-07-13 11:14:59,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:14:59,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:59,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:14:59,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:59,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-07-13 11:14:59,835 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-13 11:14:59,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 11:14:59,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:59,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 11:14:59,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:59,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-07-13 11:15:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:15:00,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:00,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2022-07-13 11:15:00,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) is different from false [2022-07-13 11:15:00,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))) is different from false [2022-07-13 11:15:00,240 INFO L356 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-07-13 11:15:00,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2022-07-13 11:15:00,246 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-13 11:15:00,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-07-13 11:15:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2022-07-13 11:15:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:00,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049824164] [2022-07-13 11:15:00,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:15:00,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090399627] [2022-07-13 11:15:00,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090399627] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:00,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:15:00,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-07-13 11:15:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157609107] [2022-07-13 11:15:00,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:00,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:15:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:15:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2022-07-13 11:15:00,267 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:00,909 WARN L833 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2022-07-13 11:15:02,919 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:15:03,548 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= 3 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 3 (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))))) is different from false [2022-07-13 11:15:05,560 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (and (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_162| 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_162| c_~N~0))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:15:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:05,697 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2022-07-13 11:15:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:15:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:15:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:05,698 INFO L225 Difference]: With dead ends: 121 [2022-07-13 11:15:05,698 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 11:15:05,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=158, Invalid=611, Unknown=15, NotChecked=406, Total=1190 [2022-07-13 11:15:05,700 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:05,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 144 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2022-07-13 11:15:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 11:15:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-13 11:15:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 102 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-07-13 11:15:05,710 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 37 [2022-07-13 11:15:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:05,711 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-07-13 11:15:05,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-07-13 11:15:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:15:05,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:05,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:05,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 11:15:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:15:05,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -204568597, now seen corresponding path program 1 times [2022-07-13 11:15:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:05,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514587753] [2022-07-13 11:15:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:15:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514587753] [2022-07-13 11:15:06,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514587753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149322033] [2022-07-13 11:15:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:06,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:06,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:06,361 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-07-13 11:15:06,362 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-07-13 11:15:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:06,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:15:06,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:06,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:15:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:06,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:15:06,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:06,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:15:06,597 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-07-13 11:15:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:06,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:06,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-13 11:15:06,711 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 28 treesize of output 24 [2022-07-13 11:15:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149322033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:06,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:06,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 34 [2022-07-13 11:15:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705789718] [2022-07-13 11:15:06,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:06,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 11:15:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 11:15:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 11:15:06,775 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:08,253 INFO L93 Difference]: Finished difference Result 211 states and 268 transitions. [2022-07-13 11:15:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 11:15:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:15:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:08,254 INFO L225 Difference]: With dead ends: 211 [2022-07-13 11:15:08,254 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 11:15:08,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=534, Invalid=5016, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 11:15:08,255 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:08,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 228 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:15:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 11:15:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2022-07-13 11:15:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2022-07-13 11:15:08,270 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 37 [2022-07-13 11:15:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:08,270 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2022-07-13 11:15:08,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2022-07-13 11:15:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:15:08,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:08,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:08,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 11:15:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:08,491 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2022-07-13 11:15:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447410419] [2022-07-13 11:15:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:08,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447410419] [2022-07-13 11:15:08,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447410419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:08,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929537675] [2022-07-13 11:15:08,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:15:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:08,569 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-07-13 11:15:08,570 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-07-13 11:15:08,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:15:08,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:15:08,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:15:08,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:08,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:08,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929537675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:08,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:08,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:15:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014779450] [2022-07-13 11:15:08,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:08,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:15:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:15:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:15:08,742 INFO L87 Difference]: Start difference. First operand 137 states and 175 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:08,953 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-07-13 11:15:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:15:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 11:15:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:08,954 INFO L225 Difference]: With dead ends: 182 [2022-07-13 11:15:08,954 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 11:15:08,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:15:08,954 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:08,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 11:15:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2022-07-13 11:15:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-07-13 11:15:08,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2022-07-13 11:15:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:08,967 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-07-13 11:15:08,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-07-13 11:15:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:15:08,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:08,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:08,985 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-07-13 11:15:09,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 11:15:09,183 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2022-07-13 11:15:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:09,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638443677] [2022-07-13 11:15:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638443677] [2022-07-13 11:15:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638443677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101904647] [2022-07-13 11:15:09,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:15:09,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:09,278 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-07-13 11:15:09,278 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-07-13 11:15:09,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:15:09,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:15:09,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:15:09,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:09,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:15:09,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101904647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:09,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:09,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:15:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198391504] [2022-07-13 11:15:09,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:15:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:15:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:15:09,478 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:09,641 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-07-13 11:15:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:15:09,642 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-13 11:15:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:09,642 INFO L225 Difference]: With dead ends: 131 [2022-07-13 11:15:09,642 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 11:15:09,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:15:09,643 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:09,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 33 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 11:15:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-13 11:15:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-13 11:15:09,649 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2022-07-13 11:15:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:09,649 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-13 11:15:09,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-13 11:15:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:15:09,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:09,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:09,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:15:09,864 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,SelfDestructingSolverStorable17 [2022-07-13 11:15:09,865 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2022-07-13 11:15:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188947083] [2022-07-13 11:15:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:15:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188947083] [2022-07-13 11:15:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188947083] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303980360] [2022-07-13 11:15:10,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:15:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:10,305 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-07-13 11:15:10,307 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-07-13 11:15:10,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:15:10,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:15:10,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 11:15:10,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:10,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:15:10,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,422 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-07-13 11:15:10,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,461 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-07-13 11:15:10,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,497 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-07-13 11:15:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,536 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-07-13 11:15:10,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,651 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-07-13 11:15:10,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,664 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-07-13 11:15:10,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,677 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-07-13 11:15:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,694 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-07-13 11:15:10,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:15:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,863 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:15:10,863 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-13 11:15:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:10,989 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:15:10,989 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:15:11,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:11,139 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:15:11,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-07-13 11:15:11,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:11,243 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:15:11,243 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 3 case distinctions, treesize of input 99 treesize of output 43 [2022-07-13 11:15:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:15:11,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:36,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5 .cse6)) (.cse0 (* c_~N~0 3))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 3 .cse3)) (not (= 3 .cse4)) (not (= 3 .cse5)) (not (= 3 .cse6)))))))))) is different from false [2022-07-13 11:15:49,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (let ((.cse5 (+ .cse0 .cse1 .cse6 .cse2 .cse3)) (.cse4 (* 3 ~N~0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:15:53,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (let ((.cse5 (+ .cse0 .cse1 .cse6 .cse2 .cse3)) (.cse4 (* 3 ~N~0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2022-07-13 11:16:01,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (let ((.cse5 (+ .cse0 .cse1 .cse6 .cse2 .cse3)) (.cse4 (* 3 ~N~0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))))))))) is different from false [2022-07-13 11:16:10,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (let ((.cse5 (+ .cse0 .cse1 .cse6 .cse2 .cse3)) (.cse4 (* 3 ~N~0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))))))))) is different from false [2022-07-13 11:16:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-07-13 11:16:15,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303980360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:15,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 53 [2022-07-13 11:16:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355341183] [2022-07-13 11:16:15,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 11:16:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:15,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 11:16:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2078, Unknown=17, NotChecked=480, Total=2756 [2022-07-13 11:16:15,776 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:19,846 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-07-13 11:16:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 11:16:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:16:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:19,847 INFO L225 Difference]: With dead ends: 115 [2022-07-13 11:16:19,847 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 11:16:19,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=384, Invalid=3650, Unknown=18, NotChecked=640, Total=4692 [2022-07-13 11:16:19,848 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 714 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:19,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 182 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 865 Invalid, 0 Unknown, 714 Unchecked, 0.5s Time] [2022-07-13 11:16:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 11:16:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2022-07-13 11:16:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-07-13 11:16:19,859 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 45 [2022-07-13 11:16:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:19,859 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-07-13 11:16:19,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.849056603773585) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-07-13 11:16:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:16:19,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:19,860 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:19,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-13 11:16:20,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:20,076 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2022-07-13 11:16:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:20,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130108265] [2022-07-13 11:16:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:20,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896064794] [2022-07-13 11:16:20,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:16:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:20,100 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-07-13 11:16:20,101 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-07-13 11:16:20,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:16:20,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 11:16:20,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:20,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 11:16:20,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:20,340 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 18 treesize of output 20 [2022-07-13 11:16:20,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:20,372 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 18 treesize of output 20 [2022-07-13 11:16:20,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:20,402 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 18 treesize of output 20 [2022-07-13 11:16:20,428 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 21 treesize of output 9 [2022-07-13 11:16:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:16:20,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:20,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-13 11:16:20,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-13 11:16:20,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:16:20,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-13 11:16:20,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:20,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-07-13 11:16:20,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:20,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-13 11:16:20,528 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 11 treesize of output 7 [2022-07-13 11:16:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-07-13 11:16:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:20,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130108265] [2022-07-13 11:16:20,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:20,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896064794] [2022-07-13 11:16:20,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896064794] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:20,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:20,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-13 11:16:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484339160] [2022-07-13 11:16:20,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:16:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:16:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-07-13 11:16:20,628 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:21,091 INFO L93 Difference]: Finished difference Result 175 states and 219 transitions. [2022-07-13 11:16:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:16:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:16:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:21,092 INFO L225 Difference]: With dead ends: 175 [2022-07-13 11:16:21,092 INFO L226 Difference]: Without dead ends: 168 [2022-07-13 11:16:21,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-07-13 11:16:21,093 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:21,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 115 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 581 Invalid, 0 Unknown, 358 Unchecked, 0.3s Time] [2022-07-13 11:16:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-13 11:16:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 118. [2022-07-13 11:16:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 117 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2022-07-13 11:16:21,116 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 45 [2022-07-13 11:16:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:21,116 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2022-07-13 11:16:21,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2022-07-13 11:16:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:16:21,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:21,117 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:21,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-13 11:16:21,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:21,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2022-07-13 11:16:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:21,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084684040] [2022-07-13 11:16:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:21,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474354695] [2022-07-13 11:16:21,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:16:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:21,343 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:21,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 11:16:21,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 11:16:21,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:21,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:16:21,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:21,490 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-07-13 11:16:21,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 37 treesize of output 17 [2022-07-13 11:16:21,603 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:16:21,603 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 27 treesize of output 26 [2022-07-13 11:16:21,629 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 18 treesize of output 20 [2022-07-13 11:16:21,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 18 treesize of output 20 [2022-07-13 11:16:21,662 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 21 treesize of output 9 [2022-07-13 11:16:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:16:21,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:21,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-13 11:16:21,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-13 11:16:21,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:16:21,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-07-13 11:16:21,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_292| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_292|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_292| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2022-07-13 11:16:21,749 INFO L356 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-07-13 11:16:21,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-07-13 11:16:21,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:21,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-13 11:16:21,762 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 11 treesize of output 7 [2022-07-13 11:16:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2022-07-13 11:16:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084684040] [2022-07-13 11:16:21,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474354695] [2022-07-13 11:16:21,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474354695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:21,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:21,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-13 11:16:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311700350] [2022-07-13 11:16:21,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:16:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:16:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2022-07-13 11:16:21,799 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:23,883 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_292| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_292|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_292| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 1) (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-07-13 11:16:25,905 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (- 2)) 1) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_292| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_292|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_292| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_933 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-13 11:16:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:26,120 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2022-07-13 11:16:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:16:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:16:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:26,121 INFO L225 Difference]: With dead ends: 196 [2022-07-13 11:16:26,121 INFO L226 Difference]: Without dead ends: 184 [2022-07-13 11:16:26,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2022-07-13 11:16:26,122 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:26,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 85 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 278 Unchecked, 0.2s Time] [2022-07-13 11:16:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-13 11:16:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2022-07-13 11:16:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 161 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-07-13 11:16:26,145 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 45 [2022-07-13 11:16:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:26,145 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-07-13 11:16:26,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-07-13 11:16:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:16:26,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:26,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:26,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:26,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:26,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2022-07-13 11:16:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:26,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481342471] [2022-07-13 11:16:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:26,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:26,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023901271] [2022-07-13 11:16:26,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:16:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:26,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:26,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 11:16:26,523 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 11:16:26,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:26,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:16:26,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:26,529 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-07-13 11:16:26,577 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 37 treesize of output 17 [2022-07-13 11:16:26,609 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:16:26,610 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 25 treesize of output 24 [2022-07-13 11:16:26,638 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:16:26,638 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 25 treesize of output 24 [2022-07-13 11:16:26,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:16:26,695 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 19 treesize of output 7 [2022-07-13 11:16:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:16:26,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:26,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-13 11:16:26,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:16:26,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-07-13 11:16:26,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-07-13 11:16:26,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3))) is different from false [2022-07-13 11:16:26,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_314| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_314| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_314| 1) |v_ULTIMATE.start_main_~i~0#1_313|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_314|)))) is different from false [2022-07-13 11:16:26,860 INFO L356 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-07-13 11:16:26,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 55 [2022-07-13 11:16:26,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:16:26,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-13 11:16:26,868 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 11 treesize of output 7 [2022-07-13 11:16:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 22 not checked. [2022-07-13 11:16:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481342471] [2022-07-13 11:16:26,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023901271] [2022-07-13 11:16:26,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023901271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:26,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:26,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-13 11:16:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932799505] [2022-07-13 11:16:26,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:26,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:16:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:16:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=222, Unknown=6, NotChecked=210, Total=506 [2022-07-13 11:16:26,896 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:28,967 WARN L833 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_314| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_314| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_314| 1) |v_ULTIMATE.start_main_~i~0#1_313|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_314|)))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-13 11:16:30,992 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_314| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_314| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_314| 1) |v_ULTIMATE.start_main_~i~0#1_313|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_314|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) is different from false [2022-07-13 11:16:33,019 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_314| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_314| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_314| 1) |v_ULTIMATE.start_main_~i~0#1_313|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_314|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1004 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))) is different from false [2022-07-13 11:16:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:33,189 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2022-07-13 11:16:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:16:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:16:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:33,190 INFO L225 Difference]: With dead ends: 235 [2022-07-13 11:16:33,190 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 11:16:33,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=83, Invalid=250, Unknown=9, NotChecked=360, Total=702 [2022-07-13 11:16:33,191 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:33,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 248 Invalid, 0 Unknown, 311 Unchecked, 0.2s Time] [2022-07-13 11:16:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 11:16:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178. [2022-07-13 11:16:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 177 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 221 transitions. [2022-07-13 11:16:33,215 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 221 transitions. Word has length 45 [2022-07-13 11:16:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:33,215 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 221 transitions. [2022-07-13 11:16:33,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 221 transitions. [2022-07-13 11:16:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:16:33,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:33,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:33,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-13 11:16:33,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 11:16:33,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 2 times [2022-07-13 11:16:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:33,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359320677] [2022-07-13 11:16:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:33,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:16:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590704088] [2022-07-13 11:16:33,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:16:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:33,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:33,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 11:16:33,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:16:33,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:33,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 11:16:33,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:33,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:16:33,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:33,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:33,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:33,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:16:33,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:16:33,678 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-07-13 11:16:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:33,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:33,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-13 11:16:33,758 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 28 treesize of output 24 [2022-07-13 11:16:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359320677] [2022-07-13 11:16:33,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:16:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590704088] [2022-07-13 11:16:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590704088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:33,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:16:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-07-13 11:16:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050946938] [2022-07-13 11:16:33,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 11:16:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 11:16:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:16:33,808 INFO L87 Difference]: Start difference. First operand 178 states and 221 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:34,168 INFO L93 Difference]: Finished difference Result 226 states and 277 transitions. [2022-07-13 11:16:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:16:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:16:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:34,169 INFO L225 Difference]: With dead ends: 226 [2022-07-13 11:16:34,169 INFO L226 Difference]: Without dead ends: 160 [2022-07-13 11:16:34,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:16:34,170 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:34,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 92 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:16:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-13 11:16:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2022-07-13 11:16:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 147 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2022-07-13 11:16:34,200 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 45 [2022-07-13 11:16:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:34,200 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2022-07-13 11:16:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-07-13 11:16:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:16:34,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:34,201 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:34,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-13 11:16:34,420 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2022-07-13 11:16:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:34,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088608709] [2022-07-13 11:16:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088608709] [2022-07-13 11:16:34,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088608709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964747360] [2022-07-13 11:16:34,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:16:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:34,553 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 11:16:34,684 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 11:16:34,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:34,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:16:34,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:34,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964747360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:34,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:34,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:16:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976213462] [2022-07-13 11:16:34,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:34,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:16:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:16:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:16:34,861 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:35,347 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-07-13 11:16:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:16:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 11:16:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:35,348 INFO L225 Difference]: With dead ends: 173 [2022-07-13 11:16:35,348 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 11:16:35,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:16:35,349 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:35,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 46 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:16:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 11:16:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 106. [2022-07-13 11:16:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.161904761904762) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2022-07-13 11:16:35,370 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 47 [2022-07-13 11:16:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:35,370 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2022-07-13 11:16:35,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2022-07-13 11:16:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:16:35,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:35,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:35,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:35,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:35,588 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2022-07-13 11:16:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:35,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131146966] [2022-07-13 11:16:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:16:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131146966] [2022-07-13 11:16:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131146966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992357979] [2022-07-13 11:16:35,697 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:16:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:35,698 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:35,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 11:16:35,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 11:16:35,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:16:35,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:16:35,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:16:35,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:16:35,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992357979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:35,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:35,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:16:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694804754] [2022-07-13 11:16:35,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:35,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:16:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:35,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:16:35,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:16:35,989 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:16:36,217 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2022-07-13 11:16:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:16:36,217 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-13 11:16:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:16:36,218 INFO L225 Difference]: With dead ends: 162 [2022-07-13 11:16:36,218 INFO L226 Difference]: Without dead ends: 84 [2022-07-13 11:16:36,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:16:36,219 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 120 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:16:36,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 40 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:16:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-13 11:16:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2022-07-13 11:16:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-07-13 11:16:36,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 48 [2022-07-13 11:16:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:16:36,235 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-07-13 11:16:36,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-07-13 11:16:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:16:36,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:16:36,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:16:36,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 11:16:36,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:36,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:16:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:16:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2022-07-13 11:16:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:16:36,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355700261] [2022-07-13 11:16:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:16:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:16:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:16:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:16:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355700261] [2022-07-13 11:16:37,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355700261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:16:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050581694] [2022-07-13 11:16:37,010 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:16:37,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:16:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:16:37,011 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:16:37,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 11:16:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:16:37,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 11:16:37,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:16:37,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:16:37,141 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-07-13 11:16:37,147 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-07-13 11:16:37,171 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-07-13 11:16:37,182 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-07-13 11:16:37,192 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-07-13 11:16:37,201 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-07-13 11:16:37,279 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-07-13 11:16:37,302 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-07-13 11:16:37,318 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-07-13 11:16:37,333 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-07-13 11:16:37,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:16:37,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:16:37,533 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:37,533 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-07-13 11:16:37,665 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:37,666 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-13 11:16:37,781 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:16:37,781 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:16:37,930 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:16:37,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 65 [2022-07-13 11:16:38,079 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:16:38,079 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 3 case distinctions, treesize of input 79 treesize of output 35 [2022-07-13 11:16:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 11:16:38,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:17:46,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_399| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_401| Int) (|v_ULTIMATE.start_main_~i~0#1_397| Int) (|v_ULTIMATE.start_main_~i~0#1_403| Int) (v_ArrVal_1293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1293))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_1293 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_403| 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_401| 4))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse7 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_399| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse6 .cse7 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_397| 4))))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (let ((.cse4 (+ .cse0 .cse5 .cse1 .cse6 .cse7 .cse2)) (.cse3 (* c_~N~0 3))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 3 .cse6)) (not (= 3 .cse7))))))))))) is different from false