./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/ms3.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 b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:33:59,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:33:59,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:33:59,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:33:59,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:33:59,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:33:59,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:33:59,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:33:59,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:33:59,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:33:59,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:33:59,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:33:59,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:33:59,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:33:59,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:33:59,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:33:59,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:33:59,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:33:59,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:33:59,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:33:59,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:33:59,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:33:59,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:33:59,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:33:59,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:33:59,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:33:59,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:33:59,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:33:59,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:33:59,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:33:59,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:33:59,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:33:59,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:33:59,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:33:59,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:33:59,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:33:59,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:33:59,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:33:59,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:33:59,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:33:59,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:33:59,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:33:59,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:33:59,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:33:59,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:33:59,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:33:59,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:33:59,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:33:59,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:33:59,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:33:59,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:33:59,339 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:33:59,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:33:59,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:33:59,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:33:59,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:33:59,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:33:59,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:33:59,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:33:59,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:33:59,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:33:59,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:33:59,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:33:59,343 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:33:59,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:33:59,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:33:59,343 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 -> b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 [2022-07-19 10:33:59,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:33:59,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:33:59,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:33:59,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:33:59,596 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:33:59,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms3.c [2022-07-19 10:33:59,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58f4fcc5/23ce19a3d40f48a789f8118c53868e15/FLAG82dbec92d [2022-07-19 10:33:59,991 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:33:59,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms3.c [2022-07-19 10:33:59,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58f4fcc5/23ce19a3d40f48a789f8118c53868e15/FLAG82dbec92d [2022-07-19 10:34:00,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58f4fcc5/23ce19a3d40f48a789f8118c53868e15 [2022-07-19 10:34:00,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:34:00,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:34:00,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:34:00,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:34:00,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:34:00,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dba9dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00, skipping insertion in model container [2022-07-19 10:34:00,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:34:00,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:34:00,185 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/ms3.c[586,599] [2022-07-19 10:34:00,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:34:00,210 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:34:00,220 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/ms3.c[586,599] [2022-07-19 10:34:00,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:34:00,244 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:34:00,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00 WrapperNode [2022-07-19 10:34:00,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:34:00,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:34:00,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:34:00,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:34:00,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,287 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-07-19 10:34:00,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:34:00,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:34:00,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:34:00,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:34:00,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:34:00,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:34:00,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:34:00,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:34:00,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (1/1) ... [2022-07-19 10:34:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:34:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:00,349 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-19 10:34:00,364 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-19 10:34:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:34:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:34:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:34:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:34:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:34:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:34:00,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:34:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:34:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:34:00,430 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:34:00,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:34:00,556 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:34:00,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:34:00,561 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:34:00,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:34:00 BoogieIcfgContainer [2022-07-19 10:34:00,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:34:00,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:34:00,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:34:00,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:34:00,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:34:00" (1/3) ... [2022-07-19 10:34:00,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a9142b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:34:00, skipping insertion in model container [2022-07-19 10:34:00,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:00" (2/3) ... [2022-07-19 10:34:00,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a9142b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:34:00, skipping insertion in model container [2022-07-19 10:34:00,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:34:00" (3/3) ... [2022-07-19 10:34:00,569 INFO L111 eAbstractionObserver]: Analyzing ICFG ms3.c [2022-07-19 10:34:00,580 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:34:00,580 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:34:00,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:34:00,631 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@4c98bf83, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@141ff8ec [2022-07-19 10:34:00,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:34:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:34:00,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:00,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:00,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-19 10:34:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131314542] [2022-07-19 10:34:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:00,811 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-19 10:34:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:00,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131314542] [2022-07-19 10:34:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131314542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:00,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:00,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:34:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708766789] [2022-07-19 10:34:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:34:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:34:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:34:00,850 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:00,859 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-19 10:34:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:34:00,860 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-19 10:34:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:00,864 INFO L225 Difference]: With dead ends: 34 [2022-07-19 10:34:00,864 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 10:34:00,870 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-19 10:34:00,873 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:00,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 10:34:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 10:34:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-19 10:34:00,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-19 10:34:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:00,893 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-19 10:34:00,893 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-19 10:34:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-19 10:34:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:34:00,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:00,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:00,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:34:00,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-19 10:34:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017201337] [2022-07-19 10:34:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:00,971 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-19 10:34:00,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017201337] [2022-07-19 10:34:00,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017201337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:00,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:00,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:34:00,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519284721] [2022-07-19 10:34:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:00,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:34:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:34:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:34:00,977 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:01,019 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-19 10:34:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:34:01,020 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-19 10:34:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:01,021 INFO L225 Difference]: With dead ends: 28 [2022-07-19 10:34:01,021 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 10:34:01,024 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-19 10:34:01,025 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:01,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 10:34:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-19 10:34:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-19 10:34:01,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-07-19 10:34:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:01,035 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-19 10:34:01,036 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-19 10:34:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-19 10:34:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:34:01,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:01,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:01,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:34:01,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-19 10:34:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:01,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000268182] [2022-07-19 10:34:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:01,142 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-19 10:34:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:01,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000268182] [2022-07-19 10:34:01,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000268182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:01,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:01,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:34:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626445892] [2022-07-19 10:34:01,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:01,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:34:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:01,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:34:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:34:01,147 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-19 10:34:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:01,191 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-19 10:34:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:34:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:34:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:01,194 INFO L225 Difference]: With dead ends: 25 [2022-07-19 10:34:01,194 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 10:34:01,197 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-19 10:34:01,202 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:01,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 10:34:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-19 10:34:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-19 10:34:01,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-07-19 10:34:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:01,209 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-19 10:34:01,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-19 10:34:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-19 10:34:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:34:01,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:01,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:01,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:34:01,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2022-07-19 10:34:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041945247] [2022-07-19 10:34:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:01,295 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-19 10:34:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041945247] [2022-07-19 10:34:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041945247] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999490509] [2022-07-19 10:34:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:01,298 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-19 10:34:01,299 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-19 10:34:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:01,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:34:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:01,415 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-19 10:34:01,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:01,449 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-19 10:34:01,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999490509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:01,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:01,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:34:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621858070] [2022-07-19 10:34:01,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:34:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:34:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:34:01,451 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:01,507 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-19 10:34:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:34:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:34:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:01,508 INFO L225 Difference]: With dead ends: 39 [2022-07-19 10:34:01,508 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 10:34:01,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 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-19 10:34:01,509 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:01,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 10:34:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-19 10:34:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-19 10:34:01,513 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-19 10:34:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:01,513 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-19 10:34:01,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-19 10:34:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:34:01,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:01,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:01,545 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-19 10:34:01,719 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-19 10:34:01,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2022-07-19 10:34:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:01,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526147671] [2022-07-19 10:34:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526147671] [2022-07-19 10:34:02,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526147671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973748138] [2022-07-19 10:34:02,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:34:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:02,128 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-19 10:34:02,129 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-19 10:34:02,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:34:02,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:02,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 10:34:02,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:02,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 10:34:02,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:02,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 10:34:02,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:02,399 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 10:34:02,400 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 45 treesize of output 39 [2022-07-19 10:34:02,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:02,599 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-19 10:34:02,600 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 32 treesize of output 13 [2022-07-19 10:34:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:02,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:08,778 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 114 treesize of output 106 [2022-07-19 10:34:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:08,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973748138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:08,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:08,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-07-19 10:34:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856917701] [2022-07-19 10:34:08,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:08,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 10:34:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 10:34:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=885, Unknown=3, NotChecked=0, Total=1056 [2022-07-19 10:34:08,949 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:09,430 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-19 10:34:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:34:09,431 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:34:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:09,431 INFO L225 Difference]: With dead ends: 40 [2022-07-19 10:34:09,431 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 10:34:09,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=321, Invalid=1568, Unknown=3, NotChecked=0, Total=1892 [2022-07-19 10:34:09,433 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:09,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 200 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-07-19 10:34:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 10:34:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-19 10:34:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-19 10:34:09,436 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-07-19 10:34:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:09,436 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-19 10:34:09,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-19 10:34:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:34:09,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:09,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:09,462 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-19 10:34:09,637 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-19 10:34:09,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2022-07-19 10:34:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:09,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735441135] [2022-07-19 10:34:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:09,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735441135] [2022-07-19 10:34:09,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735441135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:09,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605043860] [2022-07-19 10:34:09,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:34:09,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:09,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:09,709 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-19 10:34:09,710 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-19 10:34:09,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:34:09,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:34:09,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:09,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:09,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605043860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:09,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:09,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:34:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768081738] [2022-07-19 10:34:09,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:34:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:34:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:34:09,820 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:09,896 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-07-19 10:34:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:34:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:34:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:09,897 INFO L225 Difference]: With dead ends: 56 [2022-07-19 10:34:09,897 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 10:34:09,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 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-19 10:34:09,898 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:09,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 10:34:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-07-19 10:34:09,902 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-19 10:34:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-19 10:34:09,902 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-19 10:34:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:09,903 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-19 10:34:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-19 10:34:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:34:09,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:09,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:09,929 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-19 10:34:10,121 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-19 10:34:10,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2022-07-19 10:34:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:10,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393981719] [2022-07-19 10:34:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:10,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393981719] [2022-07-19 10:34:10,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393981719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:10,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98544914] [2022-07-19 10:34:10,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:34:10,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:10,555 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-19 10:34:10,557 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-19 10:34:10,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:34:10,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:10,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 10:34:10,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:10,639 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-19 10:34:10,695 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 10:34:10,695 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 23 treesize of output 22 [2022-07-19 10:34:10,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:10,789 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:34:10,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:34:10,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:10,870 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-19 10:34:10,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2022-07-19 10:34:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:10,980 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:34:10,980 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 58 treesize of output 40 [2022-07-19 10:34:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:11,994 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:34:11,994 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 47 treesize of output 15 [2022-07-19 10:34:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:12,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:32,082 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:34:32,083 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 914 treesize of output 890 [2022-07-19 10:34:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:32,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98544914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:32,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:32,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2022-07-19 10:34:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429775792] [2022-07-19 10:34:32,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:32,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 10:34:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:32,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 10:34:32,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1360, Unknown=8, NotChecked=0, Total=1560 [2022-07-19 10:34:32,511 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 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-19 10:34:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:45,671 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-19 10:34:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 10:34:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 10:34:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:45,673 INFO L225 Difference]: With dead ends: 72 [2022-07-19 10:34:45,673 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 10:34:45,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=441, Invalid=2968, Unknown=13, NotChecked=0, Total=3422 [2022-07-19 10:34:45,675 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:45,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 107 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 371 Invalid, 0 Unknown, 259 Unchecked, 0.2s Time] [2022-07-19 10:34:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 10:34:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-07-19 10:34:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-19 10:34:45,682 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2022-07-19 10:34:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:45,682 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-19 10:34:45,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 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-19 10:34:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-19 10:34:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:34:45,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:45,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:45,702 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-19 10:34:45,895 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-19 10:34:45,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2022-07-19 10:34:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236425170] [2022-07-19 10:34:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236425170] [2022-07-19 10:34:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236425170] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106326203] [2022-07-19 10:34:45,984 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:34:45,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:45,985 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-19 10:34:45,986 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-19 10:34:46,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 10:34:46,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:46,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:34:46,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:46,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106326203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:46,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:34:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701424378] [2022-07-19 10:34:46,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:34:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:34:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:34:46,169 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:46,300 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-19 10:34:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:34:46,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:34:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:46,301 INFO L225 Difference]: With dead ends: 81 [2022-07-19 10:34:46,301 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 10:34:46,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:34:46,302 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:46,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 41 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:34:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 10:34:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-07-19 10:34:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-19 10:34:46,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2022-07-19 10:34:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:46,310 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-19 10:34:46,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-19 10:34:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:34:46,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:46,311 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:46,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:34:46,533 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-19 10:34:46,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1914654111, now seen corresponding path program 6 times [2022-07-19 10:34:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:46,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792243755] [2022-07-19 10:34:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:46,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792243755] [2022-07-19 10:34:46,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792243755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:46,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083941319] [2022-07-19 10:34:46,638 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:34:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:46,646 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-19 10:34:46,648 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-19 10:34:46,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:34:46,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:46,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:34:46,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:34:46,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:34:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083941319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:46,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:46,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-19 10:34:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139679769] [2022-07-19 10:34:46,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:34:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:34:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:34:46,860 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:47,129 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-19 10:34:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:34:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-19 10:34:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:47,131 INFO L225 Difference]: With dead ends: 65 [2022-07-19 10:34:47,131 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 10:34:47,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:34:47,132 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:47,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:34:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 10:34:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-07-19 10:34:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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-19 10:34:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-19 10:34:47,138 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2022-07-19 10:34:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:47,140 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-19 10:34:47,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-19 10:34:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:34:47,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:47,142 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:47,159 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-19 10:34:47,343 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-19 10:34:47,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 7 times [2022-07-19 10:34:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:47,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063000519] [2022-07-19 10:34:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063000519] [2022-07-19 10:34:48,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063000519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877386110] [2022-07-19 10:34:48,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:34:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:48,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:48,049 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-19 10:34:48,050 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-19 10:34:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:48,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 10:34:48,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:48,110 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-19 10:34:48,147 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-19 10:34:48,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:48,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-07-19 10:34:48,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:48,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:48,395 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 65 treesize of output 67 [2022-07-19 10:34:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,389 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 90 treesize of output 95 [2022-07-19 10:34:49,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:34:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:49,690 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 114 treesize of output 103 [2022-07-19 10:34:50,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:34:50,019 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 132 treesize of output 103 [2022-07-19 10:34:50,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:34:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,344 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 143 treesize of output 102 [2022-07-19 10:34:50,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:50,589 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 144 treesize of output 34 [2022-07-19 10:34:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:50,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:56,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_281 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 2))))) is different from false [2022-07-19 10:35:07,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse1 (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_276)))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (< .cse0 ~N~0)) (<= (+ v_ArrVal_281 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)) (let ((.cse3 (mod .cse0 3))) (and (or (not (<= v_ArrVal_276 .cse3)) (and (< .cse0 0) (not (= .cse3 0)))) (< .cse3 (+ v_ArrVal_276 3)))) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) is different from false [2022-07-19 10:35:10,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (v_ArrVal_273 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (not (<= v_ArrVal_277 0)) (<= (+ v_ArrVal_281 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse2 ~N~0)) (let ((.cse3 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (and (< .cse3 (+ v_ArrVal_273 3)) (or (and (not (= .cse3 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_273 .cse3))))) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse4 (mod .cse2 3))) (and (or (not (<= v_ArrVal_276 .cse4)) (and (< .cse2 0) (not (= .cse4 0)))) (< .cse4 (+ v_ArrVal_276 3)))))))) is different from false [2022-07-19 10:35:22,528 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 10:35:22,529 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 16588 treesize of output 16372 [2022-07-19 10:35:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-19 10:35:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877386110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:35:28,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:35:28,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 50 [2022-07-19 10:35:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458651253] [2022-07-19 10:35:28,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:35:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-19 10:35:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:35:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-19 10:35:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1941, Unknown=12, NotChecked=276, Total=2450 [2022-07-19 10:35:28,363 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:43,386 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_281 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 2))))) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276)))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (< .cse1 ~N~0)) (<= (+ v_ArrVal_281 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)) (let ((.cse4 (mod .cse1 3))) (and (or (not (<= v_ArrVal_276 .cse4)) (and (< .cse1 0) (not (= .cse4 0)))) (< .cse4 (+ v_ArrVal_276 3)))) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))) is different from false [2022-07-19 10:35:45,479 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_281 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 2))))) (forall ((~N~0 Int)) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse1 (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_276)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse3 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (and (< .cse3 (+ v_ArrVal_276 3)) (or (and (not (= .cse3 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_276 .cse3))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_281 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-19 10:35:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:46,315 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-19 10:35:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 10:35:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-19 10:35:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:46,316 INFO L225 Difference]: With dead ends: 80 [2022-07-19 10:35:46,316 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 10:35:46,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=447, Invalid=3464, Unknown=15, NotChecked=630, Total=4556 [2022-07-19 10:35:46,318 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:46,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2022-07-19 10:35:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 10:35:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 46. [2022-07-19 10:35:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-07-19 10:35:46,326 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 31 [2022-07-19 10:35:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:46,327 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-07-19 10:35:46,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-07-19 10:35:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:35:46,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:46,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:46,345 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-19 10:35:46,545 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-19 10:35:46,546 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -880704545, now seen corresponding path program 8 times [2022-07-19 10:35:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:46,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789144644] [2022-07-19 10:35:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:47,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:35:47,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789144644] [2022-07-19 10:35:47,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789144644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:35:47,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962123827] [2022-07-19 10:35:47,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:35:47,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:47,509 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-19 10:35:47,510 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-19 10:35:47,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:35:47,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:35:47,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-19 10:35:47,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:47,628 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-19 10:35:47,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,698 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 32 treesize of output 31 [2022-07-19 10:35:47,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-07-19 10:35:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:47,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-19 10:35:48,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-19 10:35:48,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:48,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-19 10:35:48,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:48,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2022-07-19 10:35:48,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:48,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2022-07-19 10:35:48,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2022-07-19 10:35:48,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:48,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-07-19 10:35:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:48,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:36:09,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_341 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_349 Int) (v_ArrVal_347 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_341)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_344 0)) (not (<= v_ArrVal_349 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_349 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 2)) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (and (or (not (<= v_ArrVal_341 .cse2)) (and (not (= .cse2 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0))) (< .cse2 (+ v_ArrVal_341 3)))) (not (<= v_ArrVal_346 (+ v_ArrVal_344 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_347 (+ v_ArrVal_346 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_346)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) is different from false [2022-07-19 10:36:29,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_341 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_339 Int) (v_ArrVal_349 Int) (v_ArrVal_347 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_339) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_341))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_349 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)) (not (<= v_ArrVal_346 (+ v_ArrVal_344 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_344 0)) (not (<= v_ArrVal_347 (+ v_ArrVal_346 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_346)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_349 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (and (< .cse2 (+ v_ArrVal_339 3)) (or (and (not (= .cse2 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_339 .cse2))))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse3 (mod .cse4 3))) (and (or (not (<= v_ArrVal_341 .cse3)) (and (< .cse4 0) (not (= .cse3 0)))) (< .cse3 (+ v_ArrVal_341 3))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:36:58,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_341 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_339 Int) (v_ArrVal_349 Int) (v_ArrVal_337 Int) (v_ArrVal_347 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_339) (+ .cse7 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_341))))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_347 (+ v_ArrVal_346 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_346)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_349 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 2 ~N~0)) (not (<= v_ArrVal_344 0)) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (and (< .cse2 (+ v_ArrVal_337 3)) (or (not (<= v_ArrVal_337 .cse2)) (and (not (= .cse2 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0))))) (not (< .cse3 ~N~0)) (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse4 (mod .cse5 3))) (and (or (not (<= v_ArrVal_341 .cse4)) (and (not (= .cse4 0)) (< .cse5 0))) (< .cse4 (+ v_ArrVal_341 3))))) (not (<= v_ArrVal_349 (+ v_ArrVal_347 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse6 (mod .cse3 3))) (and (or (not (<= v_ArrVal_339 .cse6)) (and (< .cse3 0) (not (= .cse6 0)))) (< .cse6 (+ v_ArrVal_339 3)))) (not (<= v_ArrVal_346 (+ v_ArrVal_344 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_344)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) is different from false [2022-07-19 10:37:31,943 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 10:37:31,945 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 2443330 treesize of output 2427490