./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/s1if.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 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:52:58,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:52:58,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:52:58,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:52:58,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:52:58,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:52:58,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:52:58,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:52:58,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:52:58,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:52:58,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:52:58,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:52:58,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:52:58,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:52:58,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:52:58,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:52:58,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:52:58,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:52:58,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:52:58,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:52:58,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:52:58,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:52:58,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:52:58,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:52:58,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:52:58,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:52:58,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:52:58,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:52:58,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:52:58,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:52:58,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:52:58,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:52:58,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:52:58,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:52:58,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:52:58,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:52:58,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:52:58,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:52:58,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:52:58,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:52:58,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:52:58,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:52:58,708 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:52:58,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:52:58,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:52:58,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:52:58,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:52:58,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:52:58,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:52:58,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:52:58,711 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:52:58,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:52:58,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:52:58,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:52:58,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:52:58,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:52:58,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:52:58,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:52:58,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:52:58,713 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:52:58,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:52:58,713 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:52:58,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:52:58,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:52:58,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:52:58,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:52:58,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:52:58,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:52:58,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:52:58,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:52:58,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:52:58,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:52:58,716 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:52:58,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:52:58,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:52:58,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:52:58,717 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2021-12-15 21:52:58,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:52:58,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:52:58,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:52:58,942 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:52:58,943 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:52:58,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1if.c [2021-12-15 21:52:59,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94f463c/536cd72b0d874b59af75bf721973f785/FLAG9e61a9dfe [2021-12-15 21:52:59,374 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:52:59,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c [2021-12-15 21:52:59,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94f463c/536cd72b0d874b59af75bf721973f785/FLAG9e61a9dfe [2021-12-15 21:52:59,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b94f463c/536cd72b0d874b59af75bf721973f785 [2021-12-15 21:52:59,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:52:59,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:52:59,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:52:59,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:52:59,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:52:59,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444602d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59, skipping insertion in model container [2021-12-15 21:52:59,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:52:59,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:52:59,547 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/s1if.c[587,600] [2021-12-15 21:52:59,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:52:59,568 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:52:59,577 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/s1if.c[587,600] [2021-12-15 21:52:59,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:52:59,592 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:52:59,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59 WrapperNode [2021-12-15 21:52:59,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:52:59,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:52:59,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:52:59,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:52:59,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,619 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-15 21:52:59,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:52:59,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:52:59,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:52:59,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:52:59,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:52:59,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:52:59,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:52:59,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:52:59,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (1/1) ... [2021-12-15 21:52:59,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:52:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:52:59,680 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) [2021-12-15 21:52:59,709 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 [2021-12-15 21:52:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:52:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:52:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 21:52:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 21:52:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 21:52:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:52:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:52:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 21:52:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 21:52:59,784 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:52:59,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:52:59,875 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:52:59,880 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:52:59,881 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 21:52:59,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:52:59 BoogieIcfgContainer [2021-12-15 21:52:59,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:52:59,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:52:59,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:52:59,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:52:59,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:52:59" (1/3) ... [2021-12-15 21:52:59,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dbdcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:52:59, skipping insertion in model container [2021-12-15 21:52:59,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:59" (2/3) ... [2021-12-15 21:52:59,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dbdcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:52:59, skipping insertion in model container [2021-12-15 21:52:59,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:52:59" (3/3) ... [2021-12-15 21:52:59,889 INFO L111 eAbstractionObserver]: Analyzing ICFG s1if.c [2021-12-15 21:52:59,893 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:52:59,893 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:52:59,933 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:52:59,949 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 21:52:59,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:52:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) [2021-12-15 21:52:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:52:59,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:52:59,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:52:59,978 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:52:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:52:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-15 21:52:59,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:52:59,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950206396] [2021-12-15 21:52:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:52:59,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:00,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:00,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950206396] [2021-12-15 21:53:00,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950206396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:53:00,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:53:00,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:53:00,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776179000] [2021-12-15 21:53:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:53:00,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:53:00,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:53:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:53:00,185 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:00,195 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-15 21:53:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:53:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 21:53:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:00,203 INFO L225 Difference]: With dead ends: 34 [2021-12-15 21:53:00,203 INFO L226 Difference]: Without dead ends: 15 [2021-12-15 21:53:00,205 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:53:00,208 INFO L933 BasicCegarLoop]: 22 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, 22 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 [2021-12-15 21:53:00,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:53:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-15 21:53:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-15 21:53:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-15 21:53:00,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-15 21:53:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:00,232 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-15 21:53:00,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-15 21:53:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:53:00,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:00,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:00,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:53:00,233 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-15 21:53:00,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:00,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714026866] [2021-12-15 21:53:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:00,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:00,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714026866] [2021-12-15 21:53:00,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714026866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:53:00,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:53:00,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:53:00,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416083607] [2021-12-15 21:53:00,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:53:00,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:53:00,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:53:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:53:00,352 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:00,408 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-15 21:53:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:53:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 21:53:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:00,410 INFO L225 Difference]: With dead ends: 28 [2021-12-15 21:53:00,410 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 21:53:00,414 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:53:00,416 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:00,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:53:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 21:53:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-15 21:53:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-15 21:53:00,426 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-15 21:53:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:00,427 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-15 21:53:00,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-15 21:53:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 21:53:00,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:00,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:00,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:53:00,433 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-15 21:53:00,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:00,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636158731] [2021-12-15 21:53:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:00,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:00,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:00,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636158731] [2021-12-15 21:53:00,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636158731] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:00,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247223323] [2021-12-15 21:53:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:00,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:00,785 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) [2021-12-15 21:53:00,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 21:53:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:00,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 21:53:00,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:00,927 INFO L388 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 [2021-12-15 21:53:00,937 INFO L388 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 [2021-12-15 21:53:00,975 INFO L388 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 [2021-12-15 21:53:01,133 INFO L388 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 [2021-12-15 21:53:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:01,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:01,565 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:01,566 INFO L388 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 26 treesize of output 27 [2021-12-15 21:53:01,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:53:01,571 INFO L388 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 24 treesize of output 16 [2021-12-15 21:53:01,575 INFO L388 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 20 treesize of output 8 [2021-12-15 21:53:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:01,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247223323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:01,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:01,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-15 21:53:01,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686959312] [2021-12-15 21:53:01,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:01,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 21:53:01,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 21:53:01,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-12-15 21:53:01,599 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:01,848 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-12-15 21:53:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:53:01,849 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 21:53:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:01,850 INFO L225 Difference]: With dead ends: 46 [2021-12-15 21:53:01,851 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 21:53:01,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2021-12-15 21:53:01,852 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:01,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-15 21:53:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 21:53:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-15 21:53:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-12-15 21:53:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 21:53:01,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2021-12-15 21:53:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:01,858 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 21:53:01,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 21:53:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 21:53:01,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:01,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:01,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:02,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:02,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-15 21:53:02,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846780993] [2021-12-15 21:53:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:02,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:02,109 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:53:02,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106331957] [2021-12-15 21:53:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:02,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:02,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:02,111 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) [2021-12-15 21:53:02,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 21:53:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:02,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 21:53:02,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:02,209 INFO L388 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 [2021-12-15 21:53:02,272 INFO L388 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 [2021-12-15 21:53:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:02,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:02,334 INFO L388 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 [2021-12-15 21:53:02,336 INFO L388 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 [2021-12-15 21:53:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:02,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:02,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846780993] [2021-12-15 21:53:02,355 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:53:02,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106331957] [2021-12-15 21:53:02,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106331957] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:02,356 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:53:02,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-15 21:53:02,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787613098] [2021-12-15 21:53:02,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:02,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 21:53:02,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 21:53:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 21:53:02,358 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:02,409 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-15 21:53:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 21:53:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 21:53:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:02,411 INFO L225 Difference]: With dead ends: 38 [2021-12-15 21:53:02,412 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 21:53:02,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:53:02,414 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:02,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:53:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 21:53:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-15 21:53:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 21:53:02,424 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-15 21:53:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:02,428 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 21:53:02,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 21:53:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 21:53:02,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:02,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:02,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 21:53:02,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 21:53:02,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-15 21:53:02,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265549800] [2021-12-15 21:53:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:02,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:02,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:02,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265549800] [2021-12-15 21:53:02,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265549800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:02,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872126377] [2021-12-15 21:53:02,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:53:02,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:02,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:02,725 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) [2021-12-15 21:53:02,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 21:53:02,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:53:02,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:02,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:53:02,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:02,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:02,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872126377] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:02,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:02,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 21:53:02,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153269981] [2021-12-15 21:53:02,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:02,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:53:02,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:02,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:53:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:53:02,912 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:03,035 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-15 21:53:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:53:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 21:53:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:03,036 INFO L225 Difference]: With dead ends: 33 [2021-12-15 21:53:03,037 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 21:53:03,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 21:53:03,038 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:03,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 21:53:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-15 21:53:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-15 21:53:03,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-15 21:53:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:03,042 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-15 21:53:03,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-15 21:53:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:53:03,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:03,043 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:03,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:03,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:03,264 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-15 21:53:03,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:03,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79539553] [2021-12-15 21:53:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:03,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:03,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:03,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79539553] [2021-12-15 21:53:03,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79539553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:03,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896819062] [2021-12-15 21:53:03,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:53:03,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:03,355 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) [2021-12-15 21:53:03,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 21:53:03,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 21:53:03,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:03,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:53:03,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:03,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:03,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896819062] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:03,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:03,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 21:53:03,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492307273] [2021-12-15 21:53:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:03,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:53:03,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:53:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:53:03,502 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:03,576 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-15 21:53:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:53:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 21:53:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:03,578 INFO L225 Difference]: With dead ends: 37 [2021-12-15 21:53:03,579 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 21:53:03,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 21:53:03,580 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:03,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 21:53:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-15 21:53:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-15 21:53:03,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-15 21:53:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:03,588 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-15 21:53:03,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-15 21:53:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:53:03,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:03,589 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:03,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:03,795 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-15 21:53:03,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:03,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523505428] [2021-12-15 21:53:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:03,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:04,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:04,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523505428] [2021-12-15 21:53:04,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523505428] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:04,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864157947] [2021-12-15 21:53:04,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:53:04,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:04,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:04,187 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) [2021-12-15 21:53:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 21:53:04,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:53:04,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:04,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 21:53:04,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:04,257 INFO L388 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 [2021-12-15 21:53:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:04,285 INFO L388 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 [2021-12-15 21:53:04,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:04,326 INFO L388 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 [2021-12-15 21:53:04,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:04,469 INFO L388 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 [2021-12-15 21:53:04,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:04,580 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:04,580 INFO L388 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 [2021-12-15 21:53:04,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:04,797 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:04,798 INFO L388 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 64 treesize of output 28 [2021-12-15 21:53:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:04,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:09,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 1 .cse4)) (not (= 1 .cse3)))))))) is different from false [2021-12-15 21:53:09,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse0 (+ .cse2 .cse3 .cse4))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 1 .cse4)) (not (= 1 .cse3)))))))) is different from false [2021-12-15 21:53:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 21:53:09,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864157947] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:09,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:09,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2021-12-15 21:53:09,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603723414] [2021-12-15 21:53:09,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:09,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 21:53:09,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 21:53:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=748, Unknown=4, NotChecked=114, Total=992 [2021-12-15 21:53:09,498 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 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) [2021-12-15 21:53:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:09,745 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-15 21:53:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 21:53:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 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 21 [2021-12-15 21:53:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:09,746 INFO L225 Difference]: With dead ends: 36 [2021-12-15 21:53:09,746 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 21:53:09,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=178, Invalid=948, Unknown=4, NotChecked=130, Total=1260 [2021-12-15 21:53:09,747 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:09,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2021-12-15 21:53:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 21:53:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-15 21:53:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-15 21:53:09,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-15 21:53:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-15 21:53:09,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 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) [2021-12-15 21:53:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-15 21:53:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:53:09,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:09,752 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:09,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:09,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-15 21:53:09,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110032337] [2021-12-15 21:53:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:09,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:09,979 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:53:09,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22038450] [2021-12-15 21:53:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:09,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:09,981 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) [2021-12-15 21:53:10,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 21:53:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:10,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 21:53:10,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:10,078 INFO L388 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 [2021-12-15 21:53:10,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:10,135 INFO L388 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 [2021-12-15 21:53:10,167 INFO L388 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 [2021-12-15 21:53:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:10,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:10,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |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 [2021-12-15 21:53:10,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1)) is different from false [2021-12-15 21:53:10,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:10,246 INFO L388 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 24 treesize of output 25 [2021-12-15 21:53:10,251 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:10,251 INFO L388 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 38 treesize of output 38 [2021-12-15 21:53:10,254 INFO L388 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 [2021-12-15 21:53:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-15 21:53:10,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:10,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110032337] [2021-12-15 21:53:10,301 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:53:10,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22038450] [2021-12-15 21:53:10,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22038450] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:10,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:53:10,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-15 21:53:10,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309867347] [2021-12-15 21:53:10,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:10,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 21:53:10,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 21:53:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-15 21:53:10,303 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-15 21:53:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:10,447 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-15 21:53:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:53:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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 [2021-12-15 21:53:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:10,448 INFO L225 Difference]: With dead ends: 41 [2021-12-15 21:53:10,448 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 21:53:10,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-15 21:53:10,449 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:10,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-15 21:53:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 21:53:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-15 21:53:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-15 21:53:10,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-15 21:53:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:10,454 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-15 21:53:10,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-15 21:53:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-15 21:53:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 21:53:10,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:10,455 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:10,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:10,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:10,678 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-15 21:53:10,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:10,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591385372] [2021-12-15 21:53:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:10,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:10,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:10,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591385372] [2021-12-15 21:53:10,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591385372] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:10,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909426383] [2021-12-15 21:53:10,751 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:53:10,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:10,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:10,752 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) [2021-12-15 21:53:10,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 21:53:10,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 21:53:10,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:10,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:53:10,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:10,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:10,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909426383] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:10,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:10,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 21:53:10,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671879621] [2021-12-15 21:53:10,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:10,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:53:10,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:53:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:53:10,967 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:11,120 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-15 21:53:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 21:53:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 21:53:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:11,121 INFO L225 Difference]: With dead ends: 41 [2021-12-15 21:53:11,121 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 21:53:11,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:53:11,122 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:11,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 28 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 21:53:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-15 21:53:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-15 21:53:11,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-15 21:53:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:11,126 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-15 21:53:11,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-15 21:53:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:53:11,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:11,127 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:11,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:11,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:11,327 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-15 21:53:11,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751457934] [2021-12-15 21:53:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:11,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:11,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751457934] [2021-12-15 21:53:11,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751457934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:11,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732958801] [2021-12-15 21:53:11,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:53:11,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:11,418 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) [2021-12-15 21:53:11,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 21:53:11,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 21:53:11,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:11,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:53:11,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:11,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:11,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732958801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:11,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:11,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 21:53:11,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215729155] [2021-12-15 21:53:11,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:11,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:53:11,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:53:11,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:53:11,600 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:11,689 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-15 21:53:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:53:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2021-12-15 21:53:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:11,690 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:53:11,690 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 21:53:11,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:53:11,691 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:11,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 21:53:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-15 21:53:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-15 21:53:11,695 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-15 21:53:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:11,695 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-15 21:53:11,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-15 21:53:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:53:11,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:11,696 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:11,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:11,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 21:53:11,916 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-15 21:53:11,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720943665] [2021-12-15 21:53:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:11,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:12,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:12,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720943665] [2021-12-15 21:53:12,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720943665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:12,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764163464] [2021-12-15 21:53:12,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 21:53:12,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:12,407 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) [2021-12-15 21:53:12,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 21:53:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:12,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-15 21:53:12,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:12,510 INFO L388 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 [2021-12-15 21:53:12,514 INFO L388 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 [2021-12-15 21:53:12,525 INFO L388 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 [2021-12-15 21:53:12,554 INFO L388 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 [2021-12-15 21:53:12,583 INFO L388 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 [2021-12-15 21:53:12,732 INFO L388 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 [2021-12-15 21:53:12,850 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:12,851 INFO L388 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 [2021-12-15 21:53:12,976 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:12,976 INFO L388 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 [2021-12-15 21:53:13,114 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:13,115 INFO L388 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 60 treesize of output 28 [2021-12-15 21:53:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:13,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:20,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_92| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (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 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_87| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 1 .cse0)) (not (= 1 .cse1)) (not (= 1 .cse2)) (let ((.cse4 (+ .cse1 .cse0 .cse5 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2021-12-15 21:53:21,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_92| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_87| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 1 .cse0)) (not (= 1 .cse1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse2 (+ .cse1 .cse0 .cse4 .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 1 .cse5))))))))) is different from false [2021-12-15 21:53:21,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_92| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~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 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_87| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 1 .cse0)) (not (= 1 .cse1)) (let ((.cse3 (+ .cse1 .cse0 .cse4 .cse5)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 3))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= 1 .cse5))))))))) is different from false [2021-12-15 21:53:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 21:53:21,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764163464] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:21,838 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:21,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2021-12-15 21:53:21,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608764762] [2021-12-15 21:53:21,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:21,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-15 21:53:21,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-15 21:53:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1331, Unknown=6, NotChecked=228, Total=1722 [2021-12-15 21:53:21,840 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:22,125 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-15 21:53:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 21:53:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 21:53:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:22,126 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:53:22,126 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 21:53:22,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=213, Invalid=1599, Unknown=6, NotChecked=252, Total=2070 [2021-12-15 21:53:22,128 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:22,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 201 Invalid, 0 Unknown, 209 Unchecked, 0.1s Time] [2021-12-15 21:53:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 21:53:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-15 21:53:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-15 21:53:22,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-15 21:53:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:22,133 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 21:53:22,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-15 21:53:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:53:22,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:22,134 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:22,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-15 21:53:22,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:22,356 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-15 21:53:22,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882226076] [2021-12-15 21:53:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:22,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:22,366 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:53:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897390257] [2021-12-15 21:53:22,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:53:22,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:22,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:22,371 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) [2021-12-15 21:53:22,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 21:53:22,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:53:22,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:22,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 21:53:22,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:22,488 INFO L388 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 [2021-12-15 21:53:22,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:22,549 INFO L388 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 [2021-12-15 21:53:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:22,586 INFO L388 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 [2021-12-15 21:53:22,621 INFO L388 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 [2021-12-15 21:53:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:22,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:22,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |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 [2021-12-15 21:53:22,690 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)) is different from false [2021-12-15 21:53:22,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)) is different from false [2021-12-15 21:53:22,712 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:22,712 INFO L388 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 24 treesize of output 25 [2021-12-15 21:53:22,717 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:22,718 INFO L388 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 38 treesize of output 38 [2021-12-15 21:53:22,721 INFO L388 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 [2021-12-15 21:53:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-15 21:53:22,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882226076] [2021-12-15 21:53:22,792 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:53:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897390257] [2021-12-15 21:53:22,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897390257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:22,792 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:53:22,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-15 21:53:22,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220504753] [2021-12-15 21:53:22,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:22,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 21:53:22,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 21:53:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-15 21:53:22,794 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:22,958 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-15 21:53:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 21:53:22,958 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 21:53:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:22,958 INFO L225 Difference]: With dead ends: 49 [2021-12-15 21:53:22,959 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 21:53:22,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2021-12-15 21:53:22,960 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:22,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-15 21:53:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 21:53:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-15 21:53:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 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) [2021-12-15 21:53:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-15 21:53:22,964 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-15 21:53:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:22,965 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-15 21:53:22,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-15 21:53:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 21:53:22,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:22,966 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:22,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-15 21:53:23,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 21:53:23,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-15 21:53:23,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961935370] [2021-12-15 21:53:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:23,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:23,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961935370] [2021-12-15 21:53:23,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961935370] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253341832] [2021-12-15 21:53:23,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:53:23,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:23,268 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) [2021-12-15 21:53:23,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 21:53:23,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:53:23,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:23,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:53:23,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:23,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:23,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253341832] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:23,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:23,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 21:53:23,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709895886] [2021-12-15 21:53:23,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:23,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:53:23,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:53:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:53:23,521 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:23,758 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-15 21:53:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 21:53:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 21:53:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:23,758 INFO L225 Difference]: With dead ends: 49 [2021-12-15 21:53:23,758 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 21:53:23,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-15 21:53:23,759 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:23,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 43 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:53:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 21:53:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-15 21:53:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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) [2021-12-15 21:53:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 21:53:23,764 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-15 21:53:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:23,764 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 21:53:23,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-15 21:53:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:53:23,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:23,765 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:23,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-15 21:53:23,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 21:53:23,971 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-15 21:53:23,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129222548] [2021-12-15 21:53:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:23,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:24,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:24,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129222548] [2021-12-15 21:53:24,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129222548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109938451] [2021-12-15 21:53:24,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:53:24,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:24,088 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) [2021-12-15 21:53:24,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 21:53:24,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 21:53:24,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:24,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:53:24,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:24,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:24,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109938451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:24,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:24,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 21:53:24,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144736767] [2021-12-15 21:53:24,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:24,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:53:24,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:53:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:53:24,333 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:24,458 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-15 21:53:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:53:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 21:53:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:24,460 INFO L225 Difference]: With dead ends: 53 [2021-12-15 21:53:24,460 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 21:53:24,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-15 21:53:24,460 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:24,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 21:53:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-15 21:53:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-15 21:53:24,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-15 21:53:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:24,464 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-15 21:53:24,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-15 21:53:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:53:24,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:24,465 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:24,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:24,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 21:53:24,666 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-15 21:53:24,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:24,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205427053] [2021-12-15 21:53:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:24,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:25,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:25,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205427053] [2021-12-15 21:53:25,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205427053] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:25,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479874694] [2021-12-15 21:53:25,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:53:25,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:25,326 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) [2021-12-15 21:53:25,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 21:53:25,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:53:25,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:25,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-15 21:53:25,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:25,408 INFO L388 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 [2021-12-15 21:53:25,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,446 INFO L388 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 [2021-12-15 21:53:25,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,492 INFO L388 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 [2021-12-15 21:53:25,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,539 INFO L388 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 [2021-12-15 21:53:25,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,596 INFO L388 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 [2021-12-15 21:53:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,794 INFO L388 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 [2021-12-15 21:53:25,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:25,937 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:25,938 INFO L388 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 [2021-12-15 21:53:26,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:26,089 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:26,089 INFO L388 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 [2021-12-15 21:53:26,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:26,253 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 21:53:26,253 INFO L388 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 91 treesize of output 60 [2021-12-15 21:53:26,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:53:26,506 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 21:53:26,506 INFO L388 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 90 treesize of output 34 [2021-12-15 21:53:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:26,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:42,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (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| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |ULTIMATE.start_main_~a~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| (+ .cse2 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (<= .cse5 (+ .cse0 .cse2 .cse1 .cse3 .cse4)))) (not (= 1 .cse2)) (not (= 1 .cse1)) (not (= 1 .cse0)) (not (= 1 .cse4)))))))))) is different from false [2021-12-15 21:53:43,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (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| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |ULTIMATE.start_main_~a~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| (+ .cse2 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (<= .cse5 (+ .cse0 .cse2 .cse1 .cse3 .cse4)))) (not (= 1 .cse2)) (not (= 1 .cse1)) (not (= 1 .cse0)) (not (= 1 .cse4)))))))))) is different from false [2021-12-15 21:53:44,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5 .cse6)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 1 .cse2)) (not (= 1 .cse3)) (not (= 1 .cse5)) (not (= 1 .cse4)))))))))) is different from false [2021-12-15 21:53:45,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= 1 .cse2)) (not (= 1 .cse3)) (not (= 1 .cse5)) (not (= 1 .cse4)))))))))) is different from false [2021-12-15 21:53:47,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 1 .cse0)) (not (= 1 .cse1)) (not (= 1 .cse2)) (not (= 1 .cse3)) (let ((.cse5 (+ .cse0 .cse1 .cse3 .cse2 .cse6)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2021-12-15 21:53:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-15 21:53:48,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479874694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:48,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:48,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 53 [2021-12-15 21:53:48,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098081171] [2021-12-15 21:53:48,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:48,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-15 21:53:48,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-15 21:53:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2066, Unknown=12, NotChecked=480, Total=2756 [2021-12-15 21:53:48,449 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 53 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:48,941 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-12-15 21:53:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 21:53:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 53 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2021-12-15 21:53:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:48,943 INFO L225 Difference]: With dead ends: 54 [2021-12-15 21:53:48,943 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 21:53:48,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=247, Invalid=2311, Unknown=12, NotChecked=510, Total=3080 [2021-12-15 21:53:48,944 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:48,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 130 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 494 Unchecked, 0.1s Time] [2021-12-15 21:53:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 21:53:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2021-12-15 21:53:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-15 21:53:48,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-15 21:53:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:48,951 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-15 21:53:48,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 53 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-15 21:53:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:53:48,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:48,952 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:48,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:49,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 21:53:49,163 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-15 21:53:49,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:49,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163405886] [2021-12-15 21:53:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:49,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:49,173 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:53:49,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049751644] [2021-12-15 21:53:49,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:53:49,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:49,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:49,175 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) [2021-12-15 21:53:49,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 21:53:49,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 21:53:49,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:49,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 21:53:49,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:49,294 INFO L388 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 [2021-12-15 21:53:49,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 21:53:49,403 INFO L388 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 [2021-12-15 21:53:49,438 INFO L388 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 [2021-12-15 21:53:49,475 INFO L388 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 [2021-12-15 21:53:49,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:49,511 INFO L388 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 [2021-12-15 21:53:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 21:53:49,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:49,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= c_~N~0 |ULTIMATE.start_main_~i~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-15 21:53:49,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:53:49,768 INFO L388 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 26 treesize of output 27 [2021-12-15 21:53:49,774 INFO L354 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-15 21:53:49,774 INFO L388 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 42 treesize of output 30 [2021-12-15 21:53:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-15 21:53:49,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:49,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163405886] [2021-12-15 21:53:49,790 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:53:49,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049751644] [2021-12-15 21:53:49,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049751644] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:49,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:53:49,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-15 21:53:49,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671701037] [2021-12-15 21:53:49,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:49,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 21:53:49,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 21:53:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-15 21:53:49,792 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:49,859 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-15 21:53:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:53:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 21:53:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:49,860 INFO L225 Difference]: With dead ends: 55 [2021-12-15 21:53:49,860 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 21:53:49,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=145, Unknown=6, NotChecked=26, Total=240 [2021-12-15 21:53:49,861 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:49,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2021-12-15 21:53:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 21:53:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-15 21:53:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-15 21:53:49,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-15 21:53:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:49,867 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-15 21:53:49,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-15 21:53:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 21:53:49,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:49,868 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:49,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:50,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:50,069 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-15 21:53:50,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:50,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145863976] [2021-12-15 21:53:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:50,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:50,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:50,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145863976] [2021-12-15 21:53:50,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145863976] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:50,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556036583] [2021-12-15 21:53:50,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:53:50,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:50,168 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) [2021-12-15 21:53:50,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 21:53:50,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 21:53:50,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:50,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 21:53:50,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:50,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:50,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556036583] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:50,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:50,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 21:53:50,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167293956] [2021-12-15 21:53:50,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:50,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 21:53:50,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 21:53:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:53:50,453 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:50,716 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-15 21:53:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 21:53:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 21:53:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:50,717 INFO L225 Difference]: With dead ends: 69 [2021-12-15 21:53:50,717 INFO L226 Difference]: Without dead ends: 65 [2021-12-15 21:53:50,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-15 21:53:50,718 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:50,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:53:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-15 21:53:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-15 21:53:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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) [2021-12-15 21:53:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-15 21:53:50,723 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-15 21:53:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:50,724 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 21:53:50,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-15 21:53:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 21:53:50,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:50,724 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:50,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:50,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 21:53:50,925 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-15 21:53:50,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907069241] [2021-12-15 21:53:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:50,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:51,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:51,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907069241] [2021-12-15 21:53:51,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907069241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123448523] [2021-12-15 21:53:51,034 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:53:51,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:51,035 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) [2021-12-15 21:53:51,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 21:53:51,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 21:53:51,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:53:51,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 21:53:51,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:51,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:53:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:51,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123448523] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:53:51,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:53:51,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 21:53:51,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453336231] [2021-12-15 21:53:51,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:53:51,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 21:53:51,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:53:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 21:53:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:53:51,324 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2021-12-15 21:53:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:53:51,450 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-15 21:53:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 21:53:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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 34 [2021-12-15 21:53:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:53:51,451 INFO L225 Difference]: With dead ends: 78 [2021-12-15 21:53:51,451 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 21:53:51,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-15 21:53:51,452 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:53:51,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:53:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 21:53:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-15 21:53:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:53:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-15 21:53:51,456 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-15 21:53:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:53:51,456 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-15 21:53:51,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 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) [2021-12-15 21:53:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-15 21:53:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 21:53:51,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:53:51,457 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:53:51,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-15 21:53:51,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 21:53:51,663 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:53:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:53:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-15 21:53:51,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:53:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190324446] [2021-12-15 21:53:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:53:51,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:53:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:52,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:53:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190324446] [2021-12-15 21:53:52,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190324446] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:53:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579423351] [2021-12-15 21:53:52,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 21:53:52,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:53:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:53:52,555 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) [2021-12-15 21:53:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 21:53:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:53:52,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 21:53:52,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:53:52,636 INFO L388 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 [2021-12-15 21:53:52,639 INFO L388 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 [2021-12-15 21:53:52,669 INFO L388 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 [2021-12-15 21:53:52,706 INFO L388 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 [2021-12-15 21:53:52,745 INFO L388 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 [2021-12-15 21:53:52,786 INFO L388 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 [2021-12-15 21:53:52,826 INFO L388 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 [2021-12-15 21:53:53,007 INFO L388 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 [2021-12-15 21:53:53,120 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:53,120 INFO L388 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 [2021-12-15 21:53:53,250 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:53,251 INFO L388 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 [2021-12-15 21:53:53,392 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:53,393 INFO L388 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 [2021-12-15 21:53:53,531 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:53,531 INFO L388 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 [2021-12-15 21:53:53,663 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:53:53,664 INFO L388 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 54 treesize of output 26 [2021-12-15 21:53:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:53:53,700 INFO L328 TraceCheckSpWp]: Computing backward predicates...