./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/brs1.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 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:58:41,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:58:41,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:58:41,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:58:41,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:58:41,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:58:41,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:58:41,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:58:41,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:58:41,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:58:41,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:58:41,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:58:41,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:58:41,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:58:41,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:58:41,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:58:41,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:58:41,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:58:41,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:58:41,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:58:41,567 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:58:41,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:58:41,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:58:41,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:58:41,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:58:41,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:58:41,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:58:41,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:58:41,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:58:41,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:58:41,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:58:41,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:58:41,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:58:41,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:58:41,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:58:41,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:58:41,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:58:41,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:58:41,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:58:41,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:58:41,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:58:41,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:58:41,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:58:41,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:58:41,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:58:41,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:58:41,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:58:41,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:58:41,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:58:41,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:58:41,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:58:41,605 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:58:41,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:58:41,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:58:41,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:58:41,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:58:41,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:58:41,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:58:41,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:58:41,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:58:41,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:58:41,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:58:41,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:58:41,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:58:41,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:58:41,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:58:41,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:58:41,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:58:41,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:58:41,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:58:41,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:58:41,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:58:41,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:58:41,609 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:58:41,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:58:41,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:58:41,610 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 -> 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 [2022-07-13 10:58:41,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:58:41,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:58:41,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:58:41,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:58:41,818 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:58:41,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs1.c [2022-07-13 10:58:41,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9baf99f8/cd5858ca54964408857ea223c4622c4b/FLAG6eeffb90e [2022-07-13 10:58:42,221 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:58:42,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs1.c [2022-07-13 10:58:42,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9baf99f8/cd5858ca54964408857ea223c4622c4b/FLAG6eeffb90e [2022-07-13 10:58:42,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9baf99f8/cd5858ca54964408857ea223c4622c4b [2022-07-13 10:58:42,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:58:42,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:58:42,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:58:42,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:58:42,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:58:42,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d1dfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42, skipping insertion in model container [2022-07-13 10:58:42,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:58:42,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:58:42,806 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/brs1.c[587,600] [2022-07-13 10:58:42,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:58:42,837 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:58:42,851 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/brs1.c[587,600] [2022-07-13 10:58:42,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:58:42,881 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:58:42,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42 WrapperNode [2022-07-13 10:58:42,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:58:42,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:58:42,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:58:42,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:58:42,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,926 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-13 10:58:42,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:58:42,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:58:42,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:58:42,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:58:42,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:58:42,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:58:42,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:58:42,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:58:42,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (1/1) ... [2022-07-13 10:58:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:58:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:42,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 10:58:43,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 10:58:43,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:58:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:58:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:58:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:58:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 10:58:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:58:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:58:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:58:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:58:43,097 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:58:43,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:58:43,197 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:58:43,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:58:43,202 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 10:58:43,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:43 BoogieIcfgContainer [2022-07-13 10:58:43,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:58:43,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:58:43,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:58:43,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:58:43,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:58:42" (1/3) ... [2022-07-13 10:58:43,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1127a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:43, skipping insertion in model container [2022-07-13 10:58:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:42" (2/3) ... [2022-07-13 10:58:43,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1127a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:43, skipping insertion in model container [2022-07-13 10:58:43,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:43" (3/3) ... [2022-07-13 10:58:43,212 INFO L111 eAbstractionObserver]: Analyzing ICFG brs1.c [2022-07-13 10:58:43,223 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:58:43,223 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:58:43,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:58:43,266 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@304e71b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66f07487 [2022-07-13 10:58:43,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:58:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 10:58:43,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:43,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:43,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-13 10:58:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309940070] [2022-07-13 10:58:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:43,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:43,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309940070] [2022-07-13 10:58:43,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309940070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:58:43,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:58:43,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:58:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156218268] [2022-07-13 10:58:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:58:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:58:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:58:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:58:43,444 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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) 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) [2022-07-13 10:58:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:43,457 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-13 10:58:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:58:43,460 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 [2022-07-13 10:58:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:43,473 INFO L225 Difference]: With dead ends: 36 [2022-07-13 10:58:43,473 INFO L226 Difference]: Without dead ends: 16 [2022-07-13 10:58:43,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:58:43,487 INFO L413 NwaCegarLoop]: 23 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, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:43,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:58:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-13 10:58:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-13 10:58:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-13 10:58:43,538 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-07-13 10:58:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:43,539 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-13 10:58:43,539 INFO L496 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) [2022-07-13 10:58:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-13 10:58:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 10:58:43,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:43,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:43,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:58:43,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-13 10:58:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:43,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684150646] [2022-07-13 10:58:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684150646] [2022-07-13 10:58:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684150646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:58:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:58:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:58:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819553188] [2022-07-13 10:58:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:58:43,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:58:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:58:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:58:43,624 INFO L87 Difference]: Start difference. First operand 16 states and 18 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) [2022-07-13 10:58:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:43,668 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-13 10:58:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:58:43,668 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 [2022-07-13 10:58:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:43,669 INFO L225 Difference]: With dead ends: 30 [2022-07-13 10:58:43,669 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 10:58:43,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:58:43,671 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:43,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:58:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 10:58:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-07-13 10:58:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-13 10:58:43,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-07-13 10:58:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:43,677 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-13 10:58:43,678 INFO L496 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) [2022-07-13 10:58:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-13 10:58:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 10:58:43,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:43,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:43,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:58:43,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-13 10:58:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:43,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572654045] [2022-07-13 10:58:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:58:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:43,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572654045] [2022-07-13 10:58:43,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572654045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:58:43,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:58:43,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 10:58:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756570747] [2022-07-13 10:58:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:58:43,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:58:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:58:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:58:43,824 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:43,863 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-13 10:58:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:58:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 10:58:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:43,865 INFO L225 Difference]: With dead ends: 26 [2022-07-13 10:58:43,865 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 10:58:43,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:58:43,867 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:43,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:58:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 10:58:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-13 10:58:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-13 10:58:43,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-07-13 10:58:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:43,872 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-13 10:58:43,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-13 10:58:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 10:58:43,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:43,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:43,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 10:58:43,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-13 10:58:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:43,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142683391] [2022-07-13 10:58:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:44,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142683391] [2022-07-13 10:58:44,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142683391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:58:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412347960] [2022-07-13 10:58:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:44,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:58:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 10:58:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:44,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 10:58:44,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:58:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:44,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:58:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:44,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412347960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:58:44,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:58:44,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 10:58:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068591794] [2022-07-13 10:58:44,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:58:44,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 10:58:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:44,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 10:58:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 10:58:44,281 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:44,393 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-13 10:58:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 10:58:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 10:58:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:44,396 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:58:44,396 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 10:58:44,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 10:58:44,402 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:44,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:58:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 10:58:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-13 10:58:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-13 10:58:44,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-07-13 10:58:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:44,407 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-13 10:58:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-13 10:58:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 10:58:44,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:44,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:44,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:58:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:44,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1179965024, now seen corresponding path program 2 times [2022-07-13 10:58:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:44,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266810835] [2022-07-13 10:58:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:44,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266810835] [2022-07-13 10:58:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266810835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:58:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825647969] [2022-07-13 10:58:44,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:58:44,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:44,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:44,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:58:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 10:58:45,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:58:45,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:58:45,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 10:58:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:58:45,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 10:58:45,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:45,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 10:58:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:45,480 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 10:58:45,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-13 10:58:47,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:47,785 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-13 10:58:47,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 13 [2022-07-13 10:58:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:47,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:58:49,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 222 [2022-07-13 10:58:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825647969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:58:49,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:58:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2022-07-13 10:58:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998218850] [2022-07-13 10:58:49,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:58:49,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 10:58:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 10:58:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=880, Unknown=2, NotChecked=0, Total=1056 [2022-07-13 10:58:49,773 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:50,187 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-13 10:58:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 10:58:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 10:58:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:50,189 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:58:50,189 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 10:58:50,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=319, Invalid=1485, Unknown=2, NotChecked=0, Total=1806 [2022-07-13 10:58:50,190 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:50,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 63 Unchecked, 0.0s Time] [2022-07-13 10:58:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 10:58:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-07-13 10:58:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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) [2022-07-13 10:58:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-13 10:58:50,196 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-07-13 10:58:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:50,197 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-13 10:58:50,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-13 10:58:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 10:58:50,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:50,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:50,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:58:50,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:50,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -373004471, now seen corresponding path program 3 times [2022-07-13 10:58:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351171022] [2022-07-13 10:58:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351171022] [2022-07-13 10:58:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351171022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:58:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303893284] [2022-07-13 10:58:50,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:58:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:50,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:58:50,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 10:58:50,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 10:58:50,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:58:50,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:58:50,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:58:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:50,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:58:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:50,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303893284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:58:50,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:58:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 10:58:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440249970] [2022-07-13 10:58:50,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:58:50,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 10:58:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 10:58:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 10:58:50,677 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:50,769 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-07-13 10:58:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 10:58:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 [2022-07-13 10:58:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:50,772 INFO L225 Difference]: With dead ends: 58 [2022-07-13 10:58:50,772 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 10:58:50,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:58:50,773 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:50,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:58:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 10:58:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-07-13 10:58:50,778 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) [2022-07-13 10:58:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-13 10:58:50,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 26 [2022-07-13 10:58:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:50,779 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-13 10:58:50,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-13 10:58:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 10:58:50,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:50,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:50,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:58:50,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:50,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -976107378, now seen corresponding path program 4 times [2022-07-13 10:58:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402979252] [2022-07-13 10:58:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:51,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402979252] [2022-07-13 10:58:51,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402979252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:58:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439056350] [2022-07-13 10:58:51,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:58:51,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:51,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:58:51,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 10:58:51,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:58:51,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:58:51,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:58:51,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:58:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:51,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:58:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:51,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439056350] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:58:51,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:58:51,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 10:58:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074987593] [2022-07-13 10:58:51,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:58:51,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 10:58:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:58:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 10:58:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 10:58:51,263 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:58:51,379 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-13 10:58:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 10:58:51,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 [2022-07-13 10:58:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:58:51,380 INFO L225 Difference]: With dead ends: 41 [2022-07-13 10:58:51,380 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 10:58:51,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 10:58:51,381 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:58:51,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:58:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 10:58:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-13 10:58:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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) [2022-07-13 10:58:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-13 10:58:51,385 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-13 10:58:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:58:51,385 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-13 10:58:51,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:58:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-13 10:58:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:58:51,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:58:51,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:58:51,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:58:51,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:51,603 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:58:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:58:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -690020773, now seen corresponding path program 5 times [2022-07-13 10:58:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:58:51,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219253516] [2022-07-13 10:58:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:58:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:58:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:58:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:58:52,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219253516] [2022-07-13 10:58:52,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219253516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:58:52,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336158618] [2022-07-13 10:58:52,097 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 10:58:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:58:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:58:52,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:58:52,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 10:58:52,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 10:58:52,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:58:52,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 10:58:52,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:58:52,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 10:58:52,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 10:58:52,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:52,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 10:58:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:52,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-13 10:58:52,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:58:52,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:52,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2022-07-13 10:58:52,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:52,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:58:52,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-13 10:58:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:58:52,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2022-07-13 10:58:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:58:52,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:02,263 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:59:02,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1332 treesize of output 1296 [2022-07-13 10:59:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:03,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336158618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:03,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:03,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 39 [2022-07-13 10:59:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158760275] [2022-07-13 10:59:03,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:03,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 10:59:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:03,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 10:59:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1301, Unknown=6, NotChecked=0, Total=1482 [2022-07-13 10:59:03,432 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:04,008 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-07-13 10:59:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 10:59:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 10:59:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:04,010 INFO L225 Difference]: With dead ends: 64 [2022-07-13 10:59:04,010 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 10:59:04,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=346, Invalid=2300, Unknown=6, NotChecked=0, Total=2652 [2022-07-13 10:59:04,011 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:04,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-07-13 10:59:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 10:59:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-07-13 10:59:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-13 10:59:04,018 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2022-07-13 10:59:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:04,019 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-13 10:59:04,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-13 10:59:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 10:59:04,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:04,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:04,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 10:59:04,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:04,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 900913518, now seen corresponding path program 6 times [2022-07-13 10:59:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:04,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014375884] [2022-07-13 10:59:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014375884] [2022-07-13 10:59:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014375884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87400690] [2022-07-13 10:59:04,332 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 10:59:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:04,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:04,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:59:04,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 10:59:04,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 10:59:04,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:59:04,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 10:59:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:04,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:04,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87400690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:04,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:04,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 10:59:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278486799] [2022-07-13 10:59:04,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:04,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 10:59:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 10:59:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:59:04,525 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:04,649 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-07-13 10:59:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 10:59:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 10:59:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:04,651 INFO L225 Difference]: With dead ends: 74 [2022-07-13 10:59:04,651 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 10:59:04,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-13 10:59:04,652 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:04,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:59:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 10:59:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-13 10:59:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-13 10:59:04,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2022-07-13 10:59:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:04,658 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-13 10:59:04,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:59:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-07-13 10:59:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 10:59:04,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:04,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:04,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 10:59:04,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:04,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1277658368, now seen corresponding path program 7 times [2022-07-13 10:59:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408205611] [2022-07-13 10:59:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:05,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408205611] [2022-07-13 10:59:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408205611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:05,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911656737] [2022-07-13 10:59:05,673 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 10:59:05,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:05,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:59:05,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 10:59:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:05,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 10:59:05,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:05,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 10:59:05,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 10:59:05,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:05,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 10:59:05,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:05,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:05,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:05,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-07-13 10:59:06,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-13 10:59:06,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:59:06,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-07-13 10:59:06,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:59:06,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2022-07-13 10:59:06,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:59:06,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2022-07-13 10:59:06,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:06,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 19 [2022-07-13 10:59:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:06,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:45,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_266)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_266 1)) (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_268 0)))))) is different from false [2022-07-13 10:59:55,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (v_ArrVal_265 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_265) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_266))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_268 0)) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_265 1)) (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 3 |c_ULTIMATE.start_main_~i~0#1|)))))) is different from false [2022-07-13 10:59:55,600 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 10:59:55,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5580 treesize of output 5508 [2022-07-13 10:59:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-13 10:59:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911656737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:57,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:57,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2022-07-13 10:59:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719558106] [2022-07-13 10:59:57,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:57,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 10:59:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 10:59:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2248, Unknown=21, NotChecked=198, Total=2756 [2022-07-13 10:59:57,359 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:03,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_266)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) c_~N~0) (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_268 0)) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (v_ArrVal_265 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_265) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_266))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_272 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_268 0)) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_265 1))))))) is different from false [2022-07-13 11:00:21,682 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_266)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_268 0)) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (forall ((v_ArrVal_268 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_272 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) c_~N~0) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_268 0)))))) is different from false [2022-07-13 11:00:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:22,098 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-07-13 11:00:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 11:00:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 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 35 [2022-07-13 11:00:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:22,099 INFO L225 Difference]: With dead ends: 79 [2022-07-13 11:00:22,099 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 11:00:22,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=548, Invalid=3996, Unknown=28, NotChecked=540, Total=5112 [2022-07-13 11:00:22,101 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:22,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 113 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 309 Invalid, 0 Unknown, 278 Unchecked, 0.2s Time] [2022-07-13 11:00:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 11:00:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2022-07-13 11:00:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-13 11:00:22,111 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 35 [2022-07-13 11:00:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:22,111 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-13 11:00:22,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-13 11:00:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:00:22,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:22,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:22,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:00:22,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:22,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1826805659, now seen corresponding path program 8 times [2022-07-13 11:00:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520557744] [2022-07-13 11:00:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:22,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520557744] [2022-07-13 11:00:22,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520557744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:22,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59271043] [2022-07-13 11:00:22,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:00:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:22,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:00:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:00:22,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:00:22,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:22,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:00:22,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:00:22,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:00:22,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59271043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:22,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:22,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-13 11:00:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800497874] [2022-07-13 11:00:22,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:22,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:00:22,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:00:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:00:22,685 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:23,055 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-13 11:00:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:00:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 11:00:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:23,056 INFO L225 Difference]: With dead ends: 80 [2022-07-13 11:00:23,056 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 11:00:23,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 11:00:23,057 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:23,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 38 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:00:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 11:00:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 39. [2022-07-13 11:00:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-13 11:00:23,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2022-07-13 11:00:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:23,066 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-13 11:00:23,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-13 11:00:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:00:23,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:23,067 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:23,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:00:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 11:00:23,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 876019369, now seen corresponding path program 9 times [2022-07-13 11:00:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242216848] [2022-07-13 11:00:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242216848] [2022-07-13 11:00:23,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242216848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018112469] [2022-07-13 11:00:23,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:00:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:23,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:00:23,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:00:23,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 11:00:23,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:23,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:00:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:23,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:23,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018112469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:23,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:23,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:00:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103226961] [2022-07-13 11:00:23,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:23,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:00:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:00:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:00:23,654 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:23,780 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-07-13 11:00:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:00:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 38 [2022-07-13 11:00:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:23,781 INFO L225 Difference]: With dead ends: 67 [2022-07-13 11:00:23,782 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 11:00:23,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:00:23,782 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:23,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 23 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:00:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 11:00:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-07-13 11:00:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-13 11:00:23,791 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2022-07-13 11:00:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:23,792 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-13 11:00:23,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:00:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-13 11:00:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:00:23,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:23,793 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:23,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:00:24,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:24,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1188189509, now seen corresponding path program 10 times [2022-07-13 11:00:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:24,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196458455] [2022-07-13 11:00:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:25,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196458455] [2022-07-13 11:00:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196458455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:25,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661379255] [2022-07-13 11:00:25,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:00:25,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:25,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:25,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:00:25,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:00:25,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:00:25,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:25,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 11:00:25,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:25,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:00:25,255 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:00:25,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:00:25,353 INFO L356 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-07-13 11:00:25,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2022-07-13 11:00:25,507 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-07-13 11:00:25,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-07-13 11:00:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:25,680 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:00:25,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-07-13 11:00:25,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:25,848 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-13 11:00:25,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 75 [2022-07-13 11:00:26,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:26,008 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-13 11:00:26,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 75 [2022-07-13 11:00:26,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:26,180 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-07-13 11:00:26,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 89 [2022-07-13 11:00:26,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:26,345 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:00:26,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 67 [2022-07-13 11:00:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:32,271 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:00:32,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 23 [2022-07-13 11:00:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:32,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:13,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_428 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_421)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_421 1)) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-13 11:02:30,128 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:02:30,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 851046 treesize of output 845664