./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/loops-crafted-1/nested_delay_notd2.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 e75363eaa8451f3d8cf8d707b181c1f456038a23 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 04:25:51,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 04:25:51,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 04:25:52,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 04:25:52,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 04:25:52,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 04:25:52,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 04:25:52,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 04:25:52,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 04:25:52,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 04:25:52,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 04:25:52,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 04:25:52,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 04:25:52,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 04:25:52,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 04:25:52,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 04:25:52,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 04:25:52,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 04:25:52,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 04:25:52,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 04:25:52,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 04:25:52,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 04:25:52,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 04:25:52,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 04:25:52,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 04:25:52,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 04:25:52,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 04:25:52,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 04:25:52,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 04:25:52,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 04:25:52,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 04:25:52,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 04:25:52,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 04:25:52,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 04:25:52,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 04:25:52,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 04:25:52,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 04:25:52,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 04:25:52,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 04:25:52,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 04:25:52,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 04:25:52,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 04:25:52,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 04:25:52,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 04:25:52,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 04:25:52,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 04:25:52,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 04:25:52,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 04:25:52,097 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 04:25:52,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 04:25:52,098 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 04:25:52,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 04:25:52,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 04:25:52,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 04:25:52,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 04:25:52,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 04:25:52,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 04:25:52,100 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 04:25:52,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 04:25:52,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 04:25:52,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 04:25:52,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 04:25:52,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 04:25:52,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 04:25:52,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 04:25:52,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 04:25:52,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 04:25:52,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 04:25:52,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 04:25:52,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 04:25:52,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 04:25:52,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 04:25:52,102 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 -> e75363eaa8451f3d8cf8d707b181c1f456038a23 [2021-08-26 04:25:52,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 04:25:52,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 04:25:52,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 04:25:52,441 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 04:25:52,442 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 04:25:52,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2021-08-26 04:25:52,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1964a6ca4/adb6dc716fb34684a6bafd40afd794f4/FLAGa1827b372 [2021-08-26 04:25:53,005 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 04:25:53,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2021-08-26 04:25:53,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1964a6ca4/adb6dc716fb34684a6bafd40afd794f4/FLAGa1827b372 [2021-08-26 04:25:53,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1964a6ca4/adb6dc716fb34684a6bafd40afd794f4 [2021-08-26 04:25:53,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 04:25:53,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 04:25:53,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 04:25:53,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 04:25:53,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 04:25:53,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5f04fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53, skipping insertion in model container [2021-08-26 04:25:53,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 04:25:53,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 04:25:53,634 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-08-26 04:25:53,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 04:25:53,654 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 04:25:53,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-08-26 04:25:53,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 04:25:53,699 INFO L208 MainTranslator]: Completed translation [2021-08-26 04:25:53,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53 WrapperNode [2021-08-26 04:25:53,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 04:25:53,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 04:25:53,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 04:25:53,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 04:25:53,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 04:25:53,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 04:25:53,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 04:25:53,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 04:25:53,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 04:25:53,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 04:25:53,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 04:25:53,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 04:25:53,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (1/1) ... [2021-08-26 04:25:53,783 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 04:25:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:53,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 04:25:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 04:25:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 04:25:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 04:25:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 04:25:53,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 04:25:54,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 04:25:54,152 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 04:25:54,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:25:54 BoogieIcfgContainer [2021-08-26 04:25:54,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 04:25:54,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 04:25:54,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 04:25:54,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 04:25:54,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:25:53" (1/3) ... [2021-08-26 04:25:54,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f2492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:25:54, skipping insertion in model container [2021-08-26 04:25:54,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:25:53" (2/3) ... [2021-08-26 04:25:54,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f2492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:25:54, skipping insertion in model container [2021-08-26 04:25:54,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:25:54" (3/3) ... [2021-08-26 04:25:54,168 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2021-08-26 04:25:54,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 04:25:54,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 04:25:54,215 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 04:25:54,221 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 04:25:54,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 04:25:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 04:25:54,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:54,238 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:54,238 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2021-08-26 04:25:54,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:54,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864477595] [2021-08-26 04:25:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:54,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:54,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864477595] [2021-08-26 04:25:54,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864477595] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:54,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:25:54,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 04:25:54,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921285544] [2021-08-26 04:25:54,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 04:25:54,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 04:25:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 04:25:54,388 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:54,400 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2021-08-26 04:25:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 04:25:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-26 04:25:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:54,407 INFO L225 Difference]: With dead ends: 33 [2021-08-26 04:25:54,407 INFO L226 Difference]: Without dead ends: 16 [2021-08-26 04:25:54,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 04:25:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-08-26 04:25:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-08-26 04:25:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2021-08-26 04:25:54,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 12 [2021-08-26 04:25:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:54,433 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-08-26 04:25:54,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2021-08-26 04:25:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 04:25:54,434 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:54,434 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:54,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 04:25:54,435 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2021-08-26 04:25:54,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:54,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574849451] [2021-08-26 04:25:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:54,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:54,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574849451] [2021-08-26 04:25:54,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574849451] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:54,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:25:54,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 04:25:54,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670914519] [2021-08-26 04:25:54,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 04:25:54,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 04:25:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 04:25:54,538 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:54,597 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2021-08-26 04:25:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 04:25:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-26 04:25:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:54,598 INFO L225 Difference]: With dead ends: 32 [2021-08-26 04:25:54,598 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 04:25:54,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 04:25:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 04:25:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-08-26 04:25:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2021-08-26 04:25:54,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2021-08-26 04:25:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:54,603 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2021-08-26 04:25:54,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2021-08-26 04:25:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 04:25:54,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:54,605 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:54,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 04:25:54,605 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2021-08-26 04:25:54,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:54,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073368098] [2021-08-26 04:25:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 04:25:54,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:54,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073368098] [2021-08-26 04:25:54,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073368098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:54,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:25:54,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 04:25:54,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173746520] [2021-08-26 04:25:54,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 04:25:54,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 04:25:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:25:54,654 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:54,701 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2021-08-26 04:25:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 04:25:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-26 04:25:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:54,703 INFO L225 Difference]: With dead ends: 38 [2021-08-26 04:25:54,703 INFO L226 Difference]: Without dead ends: 25 [2021-08-26 04:25:54,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:25:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-08-26 04:25:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2021-08-26 04:25:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-08-26 04:25:54,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 15 [2021-08-26 04:25:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:54,707 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-08-26 04:25:54,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2021-08-26 04:25:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 04:25:54,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:54,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:54,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 04:25:54,709 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:54,710 INFO L82 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2021-08-26 04:25:54,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:54,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210571276] [2021-08-26 04:25:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 04:25:54,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:54,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210571276] [2021-08-26 04:25:54,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210571276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:54,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:25:54,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 04:25:54,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403710326] [2021-08-26 04:25:54,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 04:25:54,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 04:25:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 04:25:54,795 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:54,842 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2021-08-26 04:25:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 04:25:54,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-26 04:25:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:54,844 INFO L225 Difference]: With dead ends: 46 [2021-08-26 04:25:54,845 INFO L226 Difference]: Without dead ends: 32 [2021-08-26 04:25:54,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 04:25:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-08-26 04:25:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-08-26 04:25:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2021-08-26 04:25:54,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 15 [2021-08-26 04:25:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:54,851 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2021-08-26 04:25:54,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2021-08-26 04:25:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 04:25:54,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:54,853 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:54,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 04:25:54,853 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2021-08-26 04:25:54,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:54,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831643300] [2021-08-26 04:25:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:54,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:54,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831643300] [2021-08-26 04:25:54,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831643300] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:54,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887519945] [2021-08-26 04:25:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:54,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:54,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:54,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:54,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 04:25:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:54,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 04:25:54,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:55,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887519945] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:55,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:55,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-26 04:25:55,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162424871] [2021-08-26 04:25:55,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 04:25:55,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 04:25:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-26 04:25:55,202 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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) [2021-08-26 04:25:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:55,292 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2021-08-26 04:25:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 04:25:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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) Word has length 15 [2021-08-26 04:25:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:55,294 INFO L225 Difference]: With dead ends: 67 [2021-08-26 04:25:55,294 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 04:25:55,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-26 04:25:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 04:25:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2021-08-26 04:25:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2021-08-26 04:25:55,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 15 [2021-08-26 04:25:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:55,300 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2021-08-26 04:25:55,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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) [2021-08-26 04:25:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2021-08-26 04:25:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 04:25:55,301 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:55,302 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:55,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:55,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:55,522 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 730990835, now seen corresponding path program 2 times [2021-08-26 04:25:55,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:55,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447418441] [2021-08-26 04:25:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:55,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:55,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:55,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447418441] [2021-08-26 04:25:55,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447418441] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:55,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241905085] [2021-08-26 04:25:55,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:25:55,647 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:55,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:55,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 04:25:55,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:25:55,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:25:55,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 04:25:55,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 04:25:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241905085] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:55,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:55,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 04:25:55,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978936123] [2021-08-26 04:25:55,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 04:25:55,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:56,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 04:25:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 04:25:56,001 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:56,192 INFO L93 Difference]: Finished difference Result 123 states and 179 transitions. [2021-08-26 04:25:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 04:25:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 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) Word has length 18 [2021-08-26 04:25:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:56,194 INFO L225 Difference]: With dead ends: 123 [2021-08-26 04:25:56,194 INFO L226 Difference]: Without dead ends: 91 [2021-08-26 04:25:56,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-08-26 04:25:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-26 04:25:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2021-08-26 04:25:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2021-08-26 04:25:56,207 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 18 [2021-08-26 04:25:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:56,208 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2021-08-26 04:25:56,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2021-08-26 04:25:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 04:25:56,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:56,209 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:56,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:56,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-26 04:25:56,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash -104466575, now seen corresponding path program 1 times [2021-08-26 04:25:56,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:56,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268976382] [2021-08-26 04:25:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:56,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:56,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:56,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268976382] [2021-08-26 04:25:56,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268976382] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:56,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26511063] [2021-08-26 04:25:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:56,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:56,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:56,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 04:25:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:56,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 04:25:56,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:56,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26511063] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:56,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:56,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-26 04:25:56,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164087472] [2021-08-26 04:25:56,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 04:25:56,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 04:25:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:25:56,776 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:56,862 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2021-08-26 04:25:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 04:25:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 04:25:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:56,867 INFO L225 Difference]: With dead ends: 199 [2021-08-26 04:25:56,867 INFO L226 Difference]: Without dead ends: 127 [2021-08-26 04:25:56,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:25:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-26 04:25:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2021-08-26 04:25:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2021-08-26 04:25:56,886 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 21 [2021-08-26 04:25:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:56,886 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2021-08-26 04:25:56,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2021-08-26 04:25:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 04:25:56,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:56,887 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:56,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:57,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:57,108 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1399176113, now seen corresponding path program 2 times [2021-08-26 04:25:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:57,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623029041] [2021-08-26 04:25:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:57,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:57,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:57,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623029041] [2021-08-26 04:25:57,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623029041] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:57,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811977259] [2021-08-26 04:25:57,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:25:57,210 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:57,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:57,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 04:25:57,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:25:57,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:25:57,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 04:25:57,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-26 04:25:57,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811977259] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:57,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:57,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-08-26 04:25:57,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340104395] [2021-08-26 04:25:57,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 04:25:57,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 04:25:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-26 04:25:57,539 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:57,778 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2021-08-26 04:25:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 04:25:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 04:25:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:57,782 INFO L225 Difference]: With dead ends: 291 [2021-08-26 04:25:57,783 INFO L226 Difference]: Without dead ends: 207 [2021-08-26 04:25:57,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-08-26 04:25:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-26 04:25:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 146. [2021-08-26 04:25:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 145 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2021-08-26 04:25:57,814 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 24 [2021-08-26 04:25:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:57,815 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2021-08-26 04:25:57,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2021-08-26 04:25:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 04:25:57,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:57,821 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:57,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:58,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:58,037 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2084547665, now seen corresponding path program 3 times [2021-08-26 04:25:58,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:58,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896016996] [2021-08-26 04:25:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:58,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:58,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:58,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896016996] [2021-08-26 04:25:58,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896016996] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:58,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196601229] [2021-08-26 04:25:58,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:25:58,141 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:58,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:58,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 04:25:58,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 04:25:58,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:25:58,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 04:25:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-26 04:25:58,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196601229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:58,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 04:25:58,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2021-08-26 04:25:58,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125736692] [2021-08-26 04:25:58,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 04:25:58,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:58,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 04:25:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:25:58,329 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:58,380 INFO L93 Difference]: Finished difference Result 334 states and 446 transitions. [2021-08-26 04:25:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 04:25:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-26 04:25:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:58,382 INFO L225 Difference]: With dead ends: 334 [2021-08-26 04:25:58,382 INFO L226 Difference]: Without dead ends: 192 [2021-08-26 04:25:58,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:25:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-26 04:25:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 164. [2021-08-26 04:25:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 163 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2021-08-26 04:25:58,404 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 27 [2021-08-26 04:25:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:58,406 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2021-08-26 04:25:58,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2021-08-26 04:25:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 04:25:58,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:58,408 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:58,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:58,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:58,613 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1868779761, now seen corresponding path program 1 times [2021-08-26 04:25:58,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:58,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734859276] [2021-08-26 04:25:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:58,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-26 04:25:58,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:58,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734859276] [2021-08-26 04:25:58,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734859276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:25:58,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:25:58,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 04:25:58,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863155375] [2021-08-26 04:25:58,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 04:25:58,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 04:25:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:25:58,640 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:58,660 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2021-08-26 04:25:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 04:25:58,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 27 [2021-08-26 04:25:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:58,662 INFO L225 Difference]: With dead ends: 336 [2021-08-26 04:25:58,662 INFO L226 Difference]: Without dead ends: 176 [2021-08-26 04:25:58,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:25:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-26 04:25:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2021-08-26 04:25:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 161 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2021-08-26 04:25:58,671 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 27 [2021-08-26 04:25:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:58,671 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2021-08-26 04:25:58,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2021-08-26 04:25:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 04:25:58,672 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:58,672 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:58,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 04:25:58,673 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1325275563, now seen corresponding path program 1 times [2021-08-26 04:25:58,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:58,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680132135] [2021-08-26 04:25:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:58,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:58,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:58,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680132135] [2021-08-26 04:25:58,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680132135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:58,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667801785] [2021-08-26 04:25:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:58,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:58,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:58,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:58,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 04:25:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:58,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 04:25:58,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:59,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667801785] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:59,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:59,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-08-26 04:25:59,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710114378] [2021-08-26 04:25:59,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 04:25:59,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 04:25:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 04:25:59,091 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:59,164 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2021-08-26 04:25:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 04:25:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 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 28 [2021-08-26 04:25:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:25:59,166 INFO L225 Difference]: With dead ends: 449 [2021-08-26 04:25:59,166 INFO L226 Difference]: Without dead ends: 291 [2021-08-26 04:25:59,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 04:25:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-08-26 04:25:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 192. [2021-08-26 04:25:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.2041884816753927) internal successors, (230), 191 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2021-08-26 04:25:59,177 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 28 [2021-08-26 04:25:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:25:59,177 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2021-08-26 04:25:59,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2021-08-26 04:25:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-26 04:25:59,178 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:25:59,178 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:25:59,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 04:25:59,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:59,405 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:25:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:25:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 2 times [2021-08-26 04:25:59,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:25:59,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534665613] [2021-08-26 04:25:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:25:59,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:25:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:25:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:59,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:25:59,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534665613] [2021-08-26 04:25:59,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534665613] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:59,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008679325] [2021-08-26 04:25:59,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:25:59,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:25:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:25:59,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:25:59,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 04:25:59,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:25:59,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:25:59,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 04:25:59,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:25:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:25:59,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008679325] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:25:59,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:25:59,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-08-26 04:25:59,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505557122] [2021-08-26 04:25:59,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-26 04:25:59,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:25:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-26 04:25:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2021-08-26 04:25:59,897 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:25:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:25:59,999 INFO L93 Difference]: Finished difference Result 509 states and 607 transitions. [2021-08-26 04:25:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 04:26:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-26 04:26:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:00,001 INFO L225 Difference]: With dead ends: 509 [2021-08-26 04:26:00,001 INFO L226 Difference]: Without dead ends: 321 [2021-08-26 04:26:00,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 106.8ms TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2021-08-26 04:26:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-08-26 04:26:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 222. [2021-08-26 04:26:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.1945701357466063) internal successors, (264), 221 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 264 transitions. [2021-08-26 04:26:00,013 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 264 transitions. Word has length 31 [2021-08-26 04:26:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:00,014 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 264 transitions. [2021-08-26 04:26:00,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 264 transitions. [2021-08-26 04:26:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 04:26:00,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:00,015 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:00,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:00,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:00,229 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1351227349, now seen corresponding path program 3 times [2021-08-26 04:26:00,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:00,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568792904] [2021-08-26 04:26:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:00,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:00,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:00,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568792904] [2021-08-26 04:26:00,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568792904] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:00,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672756338] [2021-08-26 04:26:00,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:00,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:00,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:00,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 04:26:00,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:00,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:00,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 04:26:00,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-08-26 04:26:00,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672756338] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:00,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 04:26:00,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2021-08-26 04:26:00,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396588080] [2021-08-26 04:26:00,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 04:26:00,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 04:26:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-08-26 04:26:00,648 INFO L87 Difference]: Start difference. First operand 222 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:00,719 INFO L93 Difference]: Finished difference Result 225 states and 266 transitions. [2021-08-26 04:26:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 04:26:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 04:26:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:00,721 INFO L225 Difference]: With dead ends: 225 [2021-08-26 04:26:00,721 INFO L226 Difference]: Without dead ends: 165 [2021-08-26 04:26:00,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 119.9ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-08-26 04:26:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-26 04:26:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2021-08-26 04:26:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2085889570552146) internal successors, (197), 163 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2021-08-26 04:26:00,731 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 34 [2021-08-26 04:26:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:00,731 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2021-08-26 04:26:00,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2021-08-26 04:26:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 04:26:00,732 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:00,732 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:00,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-26 04:26:00,962 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1860700439, now seen corresponding path program 1 times [2021-08-26 04:26:00,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:00,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529201004] [2021-08-26 04:26:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:00,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:01,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:01,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529201004] [2021-08-26 04:26:01,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529201004] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:01,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115915469] [2021-08-26 04:26:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:01,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:01,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:01,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:01,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 04:26:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:01,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 04:26:01,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:01,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115915469] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:01,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:01,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-08-26 04:26:01,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040142425] [2021-08-26 04:26:01,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 04:26:01,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:01,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 04:26:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:26:01,494 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:01,602 INFO L93 Difference]: Finished difference Result 443 states and 529 transitions. [2021-08-26 04:26:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 04:26:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 04:26:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:01,604 INFO L225 Difference]: With dead ends: 443 [2021-08-26 04:26:01,604 INFO L226 Difference]: Without dead ends: 283 [2021-08-26 04:26:01,605 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 135.3ms TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:26:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-26 04:26:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 188. [2021-08-26 04:26:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2032085561497325) internal successors, (225), 187 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2021-08-26 04:26:01,615 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 34 [2021-08-26 04:26:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:01,616 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2021-08-26 04:26:01,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2021-08-26 04:26:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 04:26:01,617 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:01,617 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:01,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:01,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-26 04:26:01,842 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1470700201, now seen corresponding path program 2 times [2021-08-26 04:26:01,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:01,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244110487] [2021-08-26 04:26:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:01,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:01,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:01,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244110487] [2021-08-26 04:26:01,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244110487] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:01,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739735435] [2021-08-26 04:26:01,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:26:01,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:01,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:01,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 04:26:02,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:26:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 04:26:02,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:02,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739735435] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:02,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:02,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-26 04:26:02,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770214025] [2021-08-26 04:26:02,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 04:26:02,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 04:26:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 04:26:02,490 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:02,609 INFO L93 Difference]: Finished difference Result 491 states and 585 transitions. [2021-08-26 04:26:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 04:26:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-08-26 04:26:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:02,612 INFO L225 Difference]: With dead ends: 491 [2021-08-26 04:26:02,612 INFO L226 Difference]: Without dead ends: 307 [2021-08-26 04:26:02,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 166.2ms TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 04:26:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-26 04:26:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2021-08-26 04:26:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.1990521327014219) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-08-26 04:26:02,627 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 37 [2021-08-26 04:26:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:02,628 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-08-26 04:26:02,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-08-26 04:26:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 04:26:02,629 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:02,629 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:02,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-26 04:26:02,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-26 04:26:02,853 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -877109527, now seen corresponding path program 3 times [2021-08-26 04:26:02,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:02,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943123008] [2021-08-26 04:26:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:02,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:02,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:02,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943123008] [2021-08-26 04:26:02,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943123008] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:02,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202761163] [2021-08-26 04:26:02,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:02,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:02,976 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:02,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-26 04:26:03,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:03,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:03,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 04:26:03,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-26 04:26:03,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202761163] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:03,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 04:26:03,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2021-08-26 04:26:03,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350313349] [2021-08-26 04:26:03,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 04:26:03,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 04:26:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:26:03,637 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) [2021-08-26 04:26:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:03,757 INFO L93 Difference]: Finished difference Result 486 states and 576 transitions. [2021-08-26 04:26:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 04:26:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) Word has length 40 [2021-08-26 04:26:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:03,759 INFO L225 Difference]: With dead ends: 486 [2021-08-26 04:26:03,760 INFO L226 Difference]: Without dead ends: 484 [2021-08-26 04:26:03,760 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 167.3ms TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-08-26 04:26:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-26 04:26:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 300. [2021-08-26 04:26:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 299 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2021-08-26 04:26:03,779 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 40 [2021-08-26 04:26:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:03,780 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2021-08-26 04:26:03,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) [2021-08-26 04:26:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2021-08-26 04:26:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 04:26:03,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:03,781 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:03,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:04,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-26 04:26:04,006 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1952423639, now seen corresponding path program 1 times [2021-08-26 04:26:04,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:04,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601245339] [2021-08-26 04:26:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:04,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-26 04:26:04,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:04,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601245339] [2021-08-26 04:26:04,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601245339] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:04,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:26:04,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 04:26:04,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381580059] [2021-08-26 04:26:04,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 04:26:04,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 04:26:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:26:04,031 INFO L87 Difference]: Start difference. First operand 300 states and 355 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:04,064 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2021-08-26 04:26:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 04:26:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-26 04:26:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:04,066 INFO L225 Difference]: With dead ends: 427 [2021-08-26 04:26:04,066 INFO L226 Difference]: Without dead ends: 319 [2021-08-26 04:26:04,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 04:26:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-08-26 04:26:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2021-08-26 04:26:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.1836065573770491) internal successors, (361), 305 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 361 transitions. [2021-08-26 04:26:04,083 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 361 transitions. Word has length 40 [2021-08-26 04:26:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:04,084 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 361 transitions. [2021-08-26 04:26:04,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 361 transitions. [2021-08-26 04:26:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 04:26:04,084 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:04,085 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:04,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 04:26:04,085 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1950517015, now seen corresponding path program 1 times [2021-08-26 04:26:04,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:04,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683258132] [2021-08-26 04:26:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:04,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:04,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:04,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683258132] [2021-08-26 04:26:04,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683258132] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:04,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820067004] [2021-08-26 04:26:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:04,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:04,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:04,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-26 04:26:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:04,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 04:26:04,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:04,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820067004] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:04,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:04,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-08-26 04:26:04,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881590449] [2021-08-26 04:26:04,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 04:26:04,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:04,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 04:26:04,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 04:26:04,861 INFO L87 Difference]: Start difference. First operand 306 states and 361 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:04,980 INFO L93 Difference]: Finished difference Result 669 states and 793 transitions. [2021-08-26 04:26:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 04:26:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-26 04:26:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:04,983 INFO L225 Difference]: With dead ends: 669 [2021-08-26 04:26:04,983 INFO L226 Difference]: Without dead ends: 439 [2021-08-26 04:26:04,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 04:26:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-08-26 04:26:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 339. [2021-08-26 04:26:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.180473372781065) internal successors, (399), 338 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 399 transitions. [2021-08-26 04:26:05,007 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 399 transitions. Word has length 40 [2021-08-26 04:26:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:05,007 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 399 transitions. [2021-08-26 04:26:05,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 399 transitions. [2021-08-26 04:26:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 04:26:05,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:05,009 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:05,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:05,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 04:26:05,229 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash -658324379, now seen corresponding path program 2 times [2021-08-26 04:26:05,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:05,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676578694] [2021-08-26 04:26:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:05,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:05,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:05,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676578694] [2021-08-26 04:26:05,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676578694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:05,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083794957] [2021-08-26 04:26:05,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:26:05,388 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:05,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:05,389 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:05,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-26 04:26:05,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:26:05,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:05,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 04:26:05,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-08-26 04:26:05,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083794957] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:05,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:05,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-08-26 04:26:05,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286237715] [2021-08-26 04:26:05,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 04:26:05,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 04:26:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:26:05,973 INFO L87 Difference]: Start difference. First operand 339 states and 399 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:06,452 INFO L93 Difference]: Finished difference Result 1075 states and 1251 transitions. [2021-08-26 04:26:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-26 04:26:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-08-26 04:26:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:06,456 INFO L225 Difference]: With dead ends: 1075 [2021-08-26 04:26:06,456 INFO L226 Difference]: Without dead ends: 821 [2021-08-26 04:26:06,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 397.6ms TimeCoverageRelationStatistics Valid=486, Invalid=996, Unknown=0, NotChecked=0, Total=1482 [2021-08-26 04:26:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-08-26 04:26:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 333. [2021-08-26 04:26:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.1686746987951808) internal successors, (388), 332 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 388 transitions. [2021-08-26 04:26:06,482 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 388 transitions. Word has length 43 [2021-08-26 04:26:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:06,482 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 388 transitions. [2021-08-26 04:26:06,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 388 transitions. [2021-08-26 04:26:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 04:26:06,483 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:06,483 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:06,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:06,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:06,708 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1311604647, now seen corresponding path program 3 times [2021-08-26 04:26:06,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:06,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146246421] [2021-08-26 04:26:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:06,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:06,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:06,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146246421] [2021-08-26 04:26:06,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146246421] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:06,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645100636] [2021-08-26 04:26:06,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:06,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:06,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:06,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-26 04:26:07,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:07,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:07,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 04:26:07,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-26 04:26:07,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645100636] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:07,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 04:26:07,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2021-08-26 04:26:07,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987703709] [2021-08-26 04:26:07,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 04:26:07,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 04:26:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-08-26 04:26:07,665 INFO L87 Difference]: Start difference. First operand 333 states and 388 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) [2021-08-26 04:26:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:07,830 INFO L93 Difference]: Finished difference Result 442 states and 513 transitions. [2021-08-26 04:26:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 04:26:07,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) Word has length 46 [2021-08-26 04:26:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:07,832 INFO L225 Difference]: With dead ends: 442 [2021-08-26 04:26:07,832 INFO L226 Difference]: Without dead ends: 440 [2021-08-26 04:26:07,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 215.0ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-08-26 04:26:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-08-26 04:26:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 333. [2021-08-26 04:26:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.1686746987951808) internal successors, (388), 332 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 388 transitions. [2021-08-26 04:26:07,862 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 388 transitions. Word has length 46 [2021-08-26 04:26:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:07,863 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 388 transitions. [2021-08-26 04:26:07,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) [2021-08-26 04:26:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 388 transitions. [2021-08-26 04:26:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 04:26:07,864 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:07,864 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:07,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:08,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:08,078 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash -53609623, now seen corresponding path program 1 times [2021-08-26 04:26:08,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:08,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680745965] [2021-08-26 04:26:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:08,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-08-26 04:26:08,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:08,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680745965] [2021-08-26 04:26:08,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680745965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:08,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:26:08,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 04:26:08,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936220166] [2021-08-26 04:26:08,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 04:26:08,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 04:26:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 04:26:08,130 INFO L87 Difference]: Start difference. First operand 333 states and 388 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2021-08-26 04:26:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:08,188 INFO L93 Difference]: Finished difference Result 561 states and 655 transitions. [2021-08-26 04:26:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 04:26:08,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 46 [2021-08-26 04:26:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:08,190 INFO L225 Difference]: With dead ends: 561 [2021-08-26 04:26:08,191 INFO L226 Difference]: Without dead ends: 448 [2021-08-26 04:26:08,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-26 04:26:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-08-26 04:26:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2021-08-26 04:26:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.1754385964912282) internal successors, (469), 399 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2021-08-26 04:26:08,216 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 46 [2021-08-26 04:26:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:08,216 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2021-08-26 04:26:08,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2021-08-26 04:26:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2021-08-26 04:26:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-26 04:26:08,217 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:08,217 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:08,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 04:26:08,218 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1284068705, now seen corresponding path program 1 times [2021-08-26 04:26:08,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:08,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440180124] [2021-08-26 04:26:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:08,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-08-26 04:26:08,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:08,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440180124] [2021-08-26 04:26:08,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440180124] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:08,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127293584] [2021-08-26 04:26:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:08,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:08,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:08,380 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:08,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-26 04:26:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:08,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 04:26:08,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-08-26 04:26:09,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127293584] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:09,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:09,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-08-26 04:26:09,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008826404] [2021-08-26 04:26:09,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-26 04:26:09,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-26 04:26:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2021-08-26 04:26:09,195 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:09,371 INFO L93 Difference]: Finished difference Result 1102 states and 1266 transitions. [2021-08-26 04:26:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 04:26:09,373 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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 87 [2021-08-26 04:26:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:09,375 INFO L225 Difference]: With dead ends: 1102 [2021-08-26 04:26:09,375 INFO L226 Difference]: Without dead ends: 793 [2021-08-26 04:26:09,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 231.3ms TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2021-08-26 04:26:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-08-26 04:26:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 439. [2021-08-26 04:26:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.17351598173516) internal successors, (514), 438 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 514 transitions. [2021-08-26 04:26:09,406 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 514 transitions. Word has length 87 [2021-08-26 04:26:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:09,407 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 514 transitions. [2021-08-26 04:26:09,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 514 transitions. [2021-08-26 04:26:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-26 04:26:09,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:09,408 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:09,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:09,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:09,628 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1856213775, now seen corresponding path program 2 times [2021-08-26 04:26:09,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:09,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084681585] [2021-08-26 04:26:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:09,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2021-08-26 04:26:09,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:09,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084681585] [2021-08-26 04:26:09,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084681585] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:09,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578419910] [2021-08-26 04:26:09,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:26:09,797 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:09,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:09,798 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:09,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-26 04:26:10,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:26:10,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:10,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 04:26:10,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2021-08-26 04:26:10,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578419910] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:10,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:10,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-08-26 04:26:10,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914231365] [2021-08-26 04:26:10,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-26 04:26:10,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-26 04:26:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2021-08-26 04:26:10,733 INFO L87 Difference]: Start difference. First operand 439 states and 514 transitions. Second operand has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:10,933 INFO L93 Difference]: Finished difference Result 1171 states and 1346 transitions. [2021-08-26 04:26:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 04:26:10,934 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-08-26 04:26:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:10,936 INFO L225 Difference]: With dead ends: 1171 [2021-08-26 04:26:10,936 INFO L226 Difference]: Without dead ends: 832 [2021-08-26 04:26:10,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 255.1ms TimeCoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2021-08-26 04:26:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-08-26 04:26:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 478. [2021-08-26 04:26:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.1719077568134173) internal successors, (559), 477 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 559 transitions. [2021-08-26 04:26:10,978 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 559 transitions. Word has length 93 [2021-08-26 04:26:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:10,978 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 559 transitions. [2021-08-26 04:26:10,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 559 transitions. [2021-08-26 04:26:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-26 04:26:10,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:10,980 INFO L512 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:11,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:11,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-26 04:26:11,192 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -267019423, now seen corresponding path program 3 times [2021-08-26 04:26:11,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:11,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164559997] [2021-08-26 04:26:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:11,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-08-26 04:26:11,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:11,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164559997] [2021-08-26 04:26:11,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164559997] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:11,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852435660] [2021-08-26 04:26:11,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:11,367 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:11,368 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:11,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-26 04:26:11,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:11,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:11,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 04:26:11,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 37 proven. 541 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2021-08-26 04:26:12,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852435660] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:12,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:12,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2021-08-26 04:26:12,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158890526] [2021-08-26 04:26:12,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-26 04:26:12,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-26 04:26:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-26 04:26:12,590 INFO L87 Difference]: Start difference. First operand 478 states and 559 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:14,230 INFO L93 Difference]: Finished difference Result 2208 states and 2540 transitions. [2021-08-26 04:26:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-26 04:26:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 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 99 [2021-08-26 04:26:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:14,241 INFO L225 Difference]: With dead ends: 2208 [2021-08-26 04:26:14,241 INFO L226 Difference]: Without dead ends: 1839 [2021-08-26 04:26:14,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 1250.8ms TimeCoverageRelationStatistics Valid=1574, Invalid=5908, Unknown=0, NotChecked=0, Total=7482 [2021-08-26 04:26:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2021-08-26 04:26:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 770. [2021-08-26 04:26:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.1716514954486346) internal successors, (901), 769 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 901 transitions. [2021-08-26 04:26:14,330 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 901 transitions. Word has length 99 [2021-08-26 04:26:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:14,331 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 901 transitions. [2021-08-26 04:26:14,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 901 transitions. [2021-08-26 04:26:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-26 04:26:14,332 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:14,332 INFO L512 BasicCegarLoop]: trace histogram [28, 28, 24, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:14,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:14,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:14,557 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash -111346257, now seen corresponding path program 1 times [2021-08-26 04:26:14,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:14,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329549776] [2021-08-26 04:26:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:14,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 49 proven. 861 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-08-26 04:26:14,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:14,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329549776] [2021-08-26 04:26:14,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329549776] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:14,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191111222] [2021-08-26 04:26:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:14,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:14,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:14,734 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:14,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-26 04:26:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:15,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 04:26:15,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 618 proven. 287 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-08-26 04:26:15,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191111222] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:15,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:15,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-08-26 04:26:15,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088231354] [2021-08-26 04:26:15,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-26 04:26:15,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:15,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-26 04:26:15,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 04:26:15,826 INFO L87 Difference]: Start difference. First operand 770 states and 901 transitions. Second operand has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:16,080 INFO L93 Difference]: Finished difference Result 1968 states and 2264 transitions. [2021-08-26 04:26:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 04:26:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 0 states have call successors, (0), 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 105 [2021-08-26 04:26:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:16,084 INFO L225 Difference]: With dead ends: 1968 [2021-08-26 04:26:16,084 INFO L226 Difference]: Without dead ends: 1316 [2021-08-26 04:26:16,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 316.4ms TimeCoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 04:26:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2021-08-26 04:26:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 809. [2021-08-26 04:26:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.1707920792079207) internal successors, (946), 808 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 946 transitions. [2021-08-26 04:26:16,156 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 946 transitions. Word has length 105 [2021-08-26 04:26:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:16,157 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 946 transitions. [2021-08-26 04:26:16,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 946 transitions. [2021-08-26 04:26:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-26 04:26:16,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:16,159 INFO L512 BasicCegarLoop]: trace histogram [30, 30, 26, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:16,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:16,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:16,384 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 802849635, now seen corresponding path program 2 times [2021-08-26 04:26:16,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:16,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031715123] [2021-08-26 04:26:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:16,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 52 proven. 990 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2021-08-26 04:26:16,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:16,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031715123] [2021-08-26 04:26:16,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031715123] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:16,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608925412] [2021-08-26 04:26:16,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:26:16,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:16,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:16,593 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-26 04:26:17,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:26:17,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:17,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 04:26:17,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-08-26 04:26:17,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608925412] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:17,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:17,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-08-26 04:26:17,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635317418] [2021-08-26 04:26:17,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-26 04:26:17,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-26 04:26:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2021-08-26 04:26:17,890 INFO L87 Difference]: Start difference. First operand 809 states and 946 transitions. Second operand has 35 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:18,171 INFO L93 Difference]: Finished difference Result 2078 states and 2393 transitions. [2021-08-26 04:26:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 04:26:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 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 111 [2021-08-26 04:26:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:18,175 INFO L225 Difference]: With dead ends: 2078 [2021-08-26 04:26:18,175 INFO L226 Difference]: Without dead ends: 1396 [2021-08-26 04:26:18,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 338.9ms TimeCoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2021-08-26 04:26:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2021-08-26 04:26:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 866. [2021-08-26 04:26:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 1.169942196531792) internal successors, (1012), 865 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1012 transitions. [2021-08-26 04:26:18,258 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1012 transitions. Word has length 111 [2021-08-26 04:26:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:18,258 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1012 transitions. [2021-08-26 04:26:18,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.5714285714285716) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1012 transitions. [2021-08-26 04:26:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-26 04:26:18,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:18,260 INFO L512 BasicCegarLoop]: trace histogram [32, 32, 28, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:18,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:18,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:18,485 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -780287697, now seen corresponding path program 3 times [2021-08-26 04:26:18,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:18,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377222067] [2021-08-26 04:26:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:18,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 55 proven. 1128 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-08-26 04:26:18,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:18,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377222067] [2021-08-26 04:26:18,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377222067] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:18,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949401229] [2021-08-26 04:26:18,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:18,711 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:18,717 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:18,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-26 04:26:19,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:19,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:19,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 04:26:19,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 807 proven. 47 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2021-08-26 04:26:19,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949401229] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:19,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:19,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 25 [2021-08-26 04:26:19,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717304443] [2021-08-26 04:26:19,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-26 04:26:19,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-26 04:26:19,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2021-08-26 04:26:19,727 INFO L87 Difference]: Start difference. First operand 866 states and 1012 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:21,273 INFO L93 Difference]: Finished difference Result 1933 states and 2278 transitions. [2021-08-26 04:26:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-08-26 04:26:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 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 117 [2021-08-26 04:26:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:21,276 INFO L225 Difference]: With dead ends: 1933 [2021-08-26 04:26:21,276 INFO L226 Difference]: Without dead ends: 1203 [2021-08-26 04:26:21,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 1261.1ms TimeCoverageRelationStatistics Valid=1816, Invalid=4990, Unknown=0, NotChecked=0, Total=6806 [2021-08-26 04:26:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-08-26 04:26:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 794. [2021-08-26 04:26:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.1235813366960907) internal successors, (891), 793 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 891 transitions. [2021-08-26 04:26:21,348 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 891 transitions. Word has length 117 [2021-08-26 04:26:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:21,349 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 891 transitions. [2021-08-26 04:26:21,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 891 transitions. [2021-08-26 04:26:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-26 04:26:21,351 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:21,351 INFO L512 BasicCegarLoop]: trace histogram [34, 34, 20, 14, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:21,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:21,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-26 04:26:21,563 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash 838744801, now seen corresponding path program 1 times [2021-08-26 04:26:21,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:21,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411463213] [2021-08-26 04:26:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:21,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2021-08-26 04:26:21,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:21,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411463213] [2021-08-26 04:26:21,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411463213] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 04:26:21,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 04:26:21,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 04:26:21,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757386360] [2021-08-26 04:26:21,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 04:26:21,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 04:26:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 04:26:21,608 INFO L87 Difference]: Start difference. First operand 794 states and 891 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:21,707 INFO L93 Difference]: Finished difference Result 1253 states and 1372 transitions. [2021-08-26 04:26:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 04:26:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-08-26 04:26:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:21,710 INFO L225 Difference]: With dead ends: 1253 [2021-08-26 04:26:21,710 INFO L226 Difference]: Without dead ends: 1051 [2021-08-26 04:26:21,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 04:26:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2021-08-26 04:26:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 803. [2021-08-26 04:26:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.125935162094763) internal successors, (903), 802 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 903 transitions. [2021-08-26 04:26:21,788 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 903 transitions. Word has length 123 [2021-08-26 04:26:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:21,788 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 903 transitions. [2021-08-26 04:26:21,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 903 transitions. [2021-08-26 04:26:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-26 04:26:21,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:21,789 INFO L512 BasicCegarLoop]: trace histogram [34, 34, 19, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:21,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 04:26:21,789 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1273355935, now seen corresponding path program 4 times [2021-08-26 04:26:21,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:21,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651302938] [2021-08-26 04:26:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:21,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 903 proven. 425 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2021-08-26 04:26:22,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:22,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651302938] [2021-08-26 04:26:22,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651302938] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:22,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120239531] [2021-08-26 04:26:22,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 04:26:22,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:22,041 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:22,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-26 04:26:22,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 04:26:22,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:22,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 04:26:22,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 1033 proven. 206 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2021-08-26 04:26:23,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120239531] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:23,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:23,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 30 [2021-08-26 04:26:23,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996886582] [2021-08-26 04:26:23,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 04:26:23,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 04:26:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2021-08-26 04:26:23,130 INFO L87 Difference]: Start difference. First operand 803 states and 903 transitions. Second operand has 30 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:24,343 INFO L93 Difference]: Finished difference Result 1871 states and 2087 transitions. [2021-08-26 04:26:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-08-26 04:26:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 0 states have call successors, (0), 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 123 [2021-08-26 04:26:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:24,347 INFO L225 Difference]: With dead ends: 1871 [2021-08-26 04:26:24,347 INFO L226 Difference]: Without dead ends: 1215 [2021-08-26 04:26:24,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 1165.9ms TimeCoverageRelationStatistics Valid=1937, Invalid=5035, Unknown=0, NotChecked=0, Total=6972 [2021-08-26 04:26:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-08-26 04:26:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 793. [2021-08-26 04:26:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.1161616161616161) internal successors, (884), 792 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 884 transitions. [2021-08-26 04:26:24,420 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 884 transitions. Word has length 123 [2021-08-26 04:26:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:24,420 INFO L470 AbstractCegarLoop]: Abstraction has 793 states and 884 transitions. [2021-08-26 04:26:24,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 884 transitions. [2021-08-26 04:26:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-08-26 04:26:24,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:24,422 INFO L512 BasicCegarLoop]: trace histogram [36, 36, 21, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:24,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:24,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-26 04:26:24,647 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1151168365, now seen corresponding path program 5 times [2021-08-26 04:26:24,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:24,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665256667] [2021-08-26 04:26:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:24,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1010 proven. 477 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2021-08-26 04:26:24,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:24,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665256667] [2021-08-26 04:26:24,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665256667] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:24,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709526326] [2021-08-26 04:26:24,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 04:26:24,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:24,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:24,915 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-26 04:26:25,591 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2021-08-26 04:26:25,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:25,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-26 04:26:25,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1257 proven. 451 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2021-08-26 04:26:26,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709526326] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:26,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:26,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2021-08-26 04:26:26,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288467385] [2021-08-26 04:26:26,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-26 04:26:26,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-26 04:26:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1553, Unknown=0, NotChecked=0, Total=1980 [2021-08-26 04:26:26,573 INFO L87 Difference]: Start difference. First operand 793 states and 884 transitions. Second operand has 45 states, 45 states have (on average 3.4444444444444446) internal successors, (155), 45 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:28,031 INFO L93 Difference]: Finished difference Result 1897 states and 2110 transitions. [2021-08-26 04:26:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-08-26 04:26:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.4444444444444446) internal successors, (155), 45 states have internal predecessors, (155), 0 states have call successors, (0), 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 129 [2021-08-26 04:26:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:28,034 INFO L225 Difference]: With dead ends: 1897 [2021-08-26 04:26:28,034 INFO L226 Difference]: Without dead ends: 1251 [2021-08-26 04:26:28,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2803 ImplicationChecksByTransitivity, 1573.8ms TimeCoverageRelationStatistics Valid=2325, Invalid=7977, Unknown=0, NotChecked=0, Total=10302 [2021-08-26 04:26:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2021-08-26 04:26:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1003. [2021-08-26 04:26:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.1047904191616766) internal successors, (1107), 1002 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1107 transitions. [2021-08-26 04:26:28,109 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1107 transitions. Word has length 129 [2021-08-26 04:26:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:28,109 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1107 transitions. [2021-08-26 04:26:28,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.4444444444444446) internal successors, (155), 45 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1107 transitions. [2021-08-26 04:26:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-08-26 04:26:28,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:28,111 INFO L512 BasicCegarLoop]: trace histogram [38, 38, 23, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:28,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:28,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:28,311 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 244793185, now seen corresponding path program 6 times [2021-08-26 04:26:28,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:28,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402690578] [2021-08-26 04:26:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:28,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 1123 proven. 532 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2021-08-26 04:26:28,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:28,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402690578] [2021-08-26 04:26:28,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402690578] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:28,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069925485] [2021-08-26 04:26:28,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 04:26:28,629 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:28,632 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:28,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-26 04:26:29,367 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-26 04:26:29,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:29,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 04:26:29,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 247 proven. 1141 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-08-26 04:26:30,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069925485] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:30,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:30,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 30 [2021-08-26 04:26:30,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425656239] [2021-08-26 04:26:30,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 04:26:30,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 04:26:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2021-08-26 04:26:30,787 INFO L87 Difference]: Start difference. First operand 1003 states and 1107 transitions. Second operand has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:33,736 INFO L93 Difference]: Finished difference Result 2162 states and 2408 transitions. [2021-08-26 04:26:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-08-26 04:26:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 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 135 [2021-08-26 04:26:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:33,744 INFO L225 Difference]: With dead ends: 2162 [2021-08-26 04:26:33,744 INFO L226 Difference]: Without dead ends: 1354 [2021-08-26 04:26:33,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5858 ImplicationChecksByTransitivity, 2722.3ms TimeCoverageRelationStatistics Valid=3764, Invalid=14326, Unknown=0, NotChecked=0, Total=18090 [2021-08-26 04:26:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2021-08-26 04:26:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1117. [2021-08-26 04:26:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1116 states have (on average 1.1155913978494623) internal successors, (1245), 1116 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1245 transitions. [2021-08-26 04:26:33,817 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1245 transitions. Word has length 135 [2021-08-26 04:26:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:33,817 INFO L470 AbstractCegarLoop]: Abstraction has 1117 states and 1245 transitions. [2021-08-26 04:26:33,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1245 transitions. [2021-08-26 04:26:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-26 04:26:33,819 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:33,819 INFO L512 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:33,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:34,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:34,033 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash 525616749, now seen corresponding path program 1 times [2021-08-26 04:26:34,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:34,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552000793] [2021-08-26 04:26:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:34,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1858 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2021-08-26 04:26:34,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:34,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552000793] [2021-08-26 04:26:34,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552000793] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:34,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907908632] [2021-08-26 04:26:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:34,688 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:34,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:34,692 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:34,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-26 04:26:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:35,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-26 04:26:35,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2021-08-26 04:26:37,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907908632] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:37,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:37,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2021-08-26 04:26:37,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059491640] [2021-08-26 04:26:37,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-08-26 04:26:37,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-08-26 04:26:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=2359, Unknown=0, NotChecked=0, Total=2970 [2021-08-26 04:26:37,877 INFO L87 Difference]: Start difference. First operand 1117 states and 1245 transitions. Second operand has 55 states, 55 states have (on average 3.018181818181818) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:41,172 INFO L93 Difference]: Finished difference Result 1938 states and 2125 transitions. [2021-08-26 04:26:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-08-26 04:26:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.018181818181818) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 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 141 [2021-08-26 04:26:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:41,176 INFO L225 Difference]: With dead ends: 1938 [2021-08-26 04:26:41,176 INFO L226 Difference]: Without dead ends: 1790 [2021-08-26 04:26:41,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5804 ImplicationChecksByTransitivity, 3725.7ms TimeCoverageRelationStatistics Valid=2911, Invalid=16271, Unknown=0, NotChecked=0, Total=19182 [2021-08-26 04:26:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2021-08-26 04:26:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1421. [2021-08-26 04:26:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.1119718309859155) internal successors, (1579), 1420 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1579 transitions. [2021-08-26 04:26:41,282 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1579 transitions. Word has length 141 [2021-08-26 04:26:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:41,282 INFO L470 AbstractCegarLoop]: Abstraction has 1421 states and 1579 transitions. [2021-08-26 04:26:41,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.018181818181818) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1579 transitions. [2021-08-26 04:26:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-26 04:26:41,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:41,285 INFO L512 BasicCegarLoop]: trace histogram [40, 40, 39, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:41,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:41,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:41,501 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash 714830123, now seen corresponding path program 2 times [2021-08-26 04:26:41,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:41,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028805327] [2021-08-26 04:26:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:41,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 587 proven. 1841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:42,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:42,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028805327] [2021-08-26 04:26:42,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028805327] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:42,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994120658] [2021-08-26 04:26:42,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:26:42,204 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:42,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:42,205 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:42,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-26 04:26:43,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:26:43,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:43,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-26 04:26:43,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 86 proven. 1752 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2021-08-26 04:26:44,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994120658] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:44,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:44,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23] total 64 [2021-08-26 04:26:44,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124075391] [2021-08-26 04:26:44,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-08-26 04:26:44,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-08-26 04:26:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=3105, Unknown=0, NotChecked=0, Total=4032 [2021-08-26 04:26:44,334 INFO L87 Difference]: Start difference. First operand 1421 states and 1579 transitions. Second operand has 64 states, 64 states have (on average 3.328125) internal successors, (213), 64 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:46,415 INFO L93 Difference]: Finished difference Result 2544 states and 2842 transitions. [2021-08-26 04:26:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-08-26 04:26:46,416 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.328125) internal successors, (213), 64 states have internal predecessors, (213), 0 states have call successors, (0), 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 141 [2021-08-26 04:26:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:46,420 INFO L225 Difference]: With dead ends: 2544 [2021-08-26 04:26:46,420 INFO L226 Difference]: Without dead ends: 1654 [2021-08-26 04:26:46,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4030 ImplicationChecksByTransitivity, 2174.3ms TimeCoverageRelationStatistics Valid=3100, Invalid=12400, Unknown=0, NotChecked=0, Total=15500 [2021-08-26 04:26:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2021-08-26 04:26:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1640. [2021-08-26 04:26:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 1.0835875533862112) internal successors, (1776), 1639 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1776 transitions. [2021-08-26 04:26:46,515 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1776 transitions. Word has length 141 [2021-08-26 04:26:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:46,516 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 1776 transitions. [2021-08-26 04:26:46,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.328125) internal successors, (213), 64 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1776 transitions. [2021-08-26 04:26:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-26 04:26:46,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:46,518 INFO L512 BasicCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:46,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-26 04:26:46,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-08-26 04:26:46,736 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2094903851, now seen corresponding path program 1 times [2021-08-26 04:26:46,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:46,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792516385] [2021-08-26 04:26:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:46,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2021-08-26 04:26:46,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:46,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792516385] [2021-08-26 04:26:46,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792516385] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:46,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054143425] [2021-08-26 04:26:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:46,797 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:46,798 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:46,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-26 04:26:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 04:26:47,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2021-08-26 04:26:48,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054143425] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:48,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:48,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 04:26:48,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955843652] [2021-08-26 04:26:48,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 04:26:48,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 04:26:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-08-26 04:26:48,818 INFO L87 Difference]: Start difference. First operand 1640 states and 1776 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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) [2021-08-26 04:26:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:48,921 INFO L93 Difference]: Finished difference Result 1796 states and 1938 transitions. [2021-08-26 04:26:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 04:26:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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) Word has length 141 [2021-08-26 04:26:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:48,927 INFO L225 Difference]: With dead ends: 1796 [2021-08-26 04:26:48,928 INFO L226 Difference]: Without dead ends: 1720 [2021-08-26 04:26:48,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-08-26 04:26:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2021-08-26 04:26:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1714. [2021-08-26 04:26:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.0817279626386456) internal successors, (1853), 1713 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1853 transitions. [2021-08-26 04:26:49,016 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1853 transitions. Word has length 141 [2021-08-26 04:26:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:49,016 INFO L470 AbstractCegarLoop]: Abstraction has 1714 states and 1853 transitions. [2021-08-26 04:26:49,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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) [2021-08-26 04:26:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1853 transitions. [2021-08-26 04:26:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-26 04:26:49,018 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:49,018 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:49,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:49,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-26 04:26:49,245 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 574504483, now seen corresponding path program 7 times [2021-08-26 04:26:49,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:49,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332278893] [2021-08-26 04:26:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:49,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 701 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 04:26:50,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:50,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332278893] [2021-08-26 04:26:50,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332278893] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:50,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636595562] [2021-08-26 04:26:50,003 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 04:26:50,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:50,005 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:50,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-26 04:26:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:51,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-26 04:26:51,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 797 proven. 1751 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 04:26:52,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636595562] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:52,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:52,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 65 [2021-08-26 04:26:52,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845617041] [2021-08-26 04:26:52,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-08-26 04:26:52,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-08-26 04:26:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=3210, Unknown=0, NotChecked=0, Total=4160 [2021-08-26 04:26:52,564 INFO L87 Difference]: Start difference. First operand 1714 states and 1853 transitions. Second operand has 65 states, 65 states have (on average 3.230769230769231) internal successors, (210), 65 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:54,702 INFO L93 Difference]: Finished difference Result 2006 states and 2163 transitions. [2021-08-26 04:26:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2021-08-26 04:26:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.230769230769231) internal successors, (210), 65 states have internal predecessors, (210), 0 states have call successors, (0), 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 144 [2021-08-26 04:26:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:54,708 INFO L225 Difference]: With dead ends: 2006 [2021-08-26 04:26:54,708 INFO L226 Difference]: Without dead ends: 1701 [2021-08-26 04:26:54,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7016 ImplicationChecksByTransitivity, 2742.6ms TimeCoverageRelationStatistics Valid=5539, Invalid=19583, Unknown=0, NotChecked=0, Total=25122 [2021-08-26 04:26:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2021-08-26 04:26:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1566. [2021-08-26 04:26:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.0830670926517572) internal successors, (1695), 1565 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1695 transitions. [2021-08-26 04:26:54,795 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1695 transitions. Word has length 144 [2021-08-26 04:26:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:54,795 INFO L470 AbstractCegarLoop]: Abstraction has 1566 states and 1695 transitions. [2021-08-26 04:26:54,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.230769230769231) internal successors, (210), 65 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1695 transitions. [2021-08-26 04:26:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-26 04:26:54,797 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:54,797 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 40, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:54,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:55,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-26 04:26:55,013 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1051056613, now seen corresponding path program 3 times [2021-08-26 04:26:55,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:55,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276379877] [2021-08-26 04:26:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:55,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2021-08-26 04:26:55,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:55,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276379877] [2021-08-26 04:26:55,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276379877] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:55,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097816893] [2021-08-26 04:26:55,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:26:55,335 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:55,337 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:55,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-26 04:26:56,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 04:26:56,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:26:56,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 04:26:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:26:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1350 proven. 20 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2021-08-26 04:26:57,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097816893] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:57,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:26:57,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 4] total 26 [2021-08-26 04:26:57,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385598589] [2021-08-26 04:26:57,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-26 04:26:57,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:26:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-26 04:26:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2021-08-26 04:26:57,087 INFO L87 Difference]: Start difference. First operand 1566 states and 1695 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:26:58,793 INFO L93 Difference]: Finished difference Result 2515 states and 2719 transitions. [2021-08-26 04:26:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-08-26 04:26:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 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 144 [2021-08-26 04:26:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:26:58,796 INFO L225 Difference]: With dead ends: 2515 [2021-08-26 04:26:58,796 INFO L226 Difference]: Without dead ends: 1151 [2021-08-26 04:26:58,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 1481.3ms TimeCoverageRelationStatistics Valid=3000, Invalid=8130, Unknown=0, NotChecked=0, Total=11130 [2021-08-26 04:26:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-08-26 04:26:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1145. [2021-08-26 04:26:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.06993006993007) internal successors, (1224), 1144 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1224 transitions. [2021-08-26 04:26:58,861 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1224 transitions. Word has length 144 [2021-08-26 04:26:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:26:58,861 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 1224 transitions. [2021-08-26 04:26:58,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:26:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1224 transitions. [2021-08-26 04:26:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-08-26 04:26:58,863 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:26:58,863 INFO L512 BasicCegarLoop]: trace histogram [60, 60, 57, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-08-26 04:26:58,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-26 04:26:59,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:59,069 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:26:59,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:26:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -668312775, now seen corresponding path program 4 times [2021-08-26 04:26:59,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:26:59,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915858914] [2021-08-26 04:26:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:26:59,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:26:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:26:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 61 proven. 4267 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2021-08-26 04:26:59,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:26:59,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915858914] [2021-08-26 04:26:59,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915858914] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:26:59,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724177612] [2021-08-26 04:26:59,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 04:26:59,736 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:26:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:26:59,737 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:26:59,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-26 04:27:01,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 04:27:01,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:01,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 62 conjunts are in the unsatisfiable core [2021-08-26 04:27:01,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 532 proven. 4392 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2021-08-26 04:27:04,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724177612] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:04,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:04,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 50] total 75 [2021-08-26 04:27:04,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3183502] [2021-08-26 04:27:04,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-08-26 04:27:04,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-08-26 04:27:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=4458, Unknown=0, NotChecked=0, Total=5550 [2021-08-26 04:27:04,546 INFO L87 Difference]: Start difference. First operand 1145 states and 1224 transitions. Second operand has 75 states, 75 states have (on average 3.2133333333333334) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:08,014 INFO L93 Difference]: Finished difference Result 1676 states and 1791 transitions. [2021-08-26 04:27:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-08-26 04:27:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.2133333333333334) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 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 209 [2021-08-26 04:27:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:08,016 INFO L225 Difference]: With dead ends: 1676 [2021-08-26 04:27:08,016 INFO L226 Difference]: Without dead ends: 768 [2021-08-26 04:27:08,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10117 ImplicationChecksByTransitivity, 4146.8ms TimeCoverageRelationStatistics Valid=4357, Invalid=23699, Unknown=0, NotChecked=0, Total=28056 [2021-08-26 04:27:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-08-26 04:27:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 346. [2021-08-26 04:27:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.0231884057971015) internal successors, (353), 345 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 353 transitions. [2021-08-26 04:27:08,032 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 353 transitions. Word has length 209 [2021-08-26 04:27:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:08,033 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 353 transitions. [2021-08-26 04:27:08,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.2133333333333334) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 353 transitions. [2021-08-26 04:27:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-08-26 04:27:08,033 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:08,033 INFO L512 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-26 04:27:08,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-26 04:27:08,234 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2084159889, now seen corresponding path program 2 times [2021-08-26 04:27:08,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:08,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53168111] [2021-08-26 04:27:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:08,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2021-08-26 04:27:08,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:08,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53168111] [2021-08-26 04:27:08,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53168111] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:08,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34176271] [2021-08-26 04:27:08,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:27:08,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:08,329 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:08,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-26 04:27:10,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:27:10,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:10,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 04:27:10,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2021-08-26 04:27:11,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34176271] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:11,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:11,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-26 04:27:11,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007308146] [2021-08-26 04:27:11,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 04:27:11,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:11,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 04:27:11,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:27:11,206 INFO L87 Difference]: Start difference. First operand 346 states and 353 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:11,273 INFO L93 Difference]: Finished difference Result 484 states and 495 transitions. [2021-08-26 04:27:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 04:27:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 209 [2021-08-26 04:27:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:11,274 INFO L225 Difference]: With dead ends: 484 [2021-08-26 04:27:11,274 INFO L226 Difference]: Without dead ends: 414 [2021-08-26 04:27:11,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 04:27:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-08-26 04:27:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2021-08-26 04:27:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.0217917675544794) internal successors, (422), 413 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 422 transitions. [2021-08-26 04:27:11,288 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 422 transitions. Word has length 209 [2021-08-26 04:27:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:11,289 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 422 transitions. [2021-08-26 04:27:11,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 422 transitions. [2021-08-26 04:27:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-08-26 04:27:11,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:11,290 INFO L512 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:11,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-26 04:27:11,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-26 04:27:11,490 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1255336115, now seen corresponding path program 3 times [2021-08-26 04:27:11,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:11,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037303740] [2021-08-26 04:27:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:11,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2021-08-26 04:27:11,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:11,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037303740] [2021-08-26 04:27:11,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037303740] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:11,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127482261] [2021-08-26 04:27:11,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:27:11,589 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:11,601 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:11,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-26 04:27:13,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-08-26 04:27:13,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:13,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 04:27:13,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2021-08-26 04:27:15,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127482261] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:15,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:15,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-08-26 04:27:15,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299636476] [2021-08-26 04:27:15,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 04:27:15,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 04:27:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 04:27:15,073 INFO L87 Difference]: Start difference. First operand 414 states and 422 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:15,157 INFO L93 Difference]: Finished difference Result 552 states and 564 transitions. [2021-08-26 04:27:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 04:27:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 277 [2021-08-26 04:27:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:15,160 INFO L225 Difference]: With dead ends: 552 [2021-08-26 04:27:15,160 INFO L226 Difference]: Without dead ends: 482 [2021-08-26 04:27:15,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 04:27:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-26 04:27:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-08-26 04:27:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.0207900207900207) internal successors, (491), 481 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 491 transitions. [2021-08-26 04:27:15,183 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 491 transitions. Word has length 277 [2021-08-26 04:27:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:15,183 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 491 transitions. [2021-08-26 04:27:15,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 491 transitions. [2021-08-26 04:27:15,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-08-26 04:27:15,185 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:15,185 INFO L512 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:15,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-08-26 04:27:15,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-26 04:27:15,401 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1898663689, now seen corresponding path program 4 times [2021-08-26 04:27:15,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:15,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307719567] [2021-08-26 04:27:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:15,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2021-08-26 04:27:15,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:15,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307719567] [2021-08-26 04:27:15,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307719567] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:15,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142387564] [2021-08-26 04:27:15,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 04:27:15,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:15,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:15,541 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:15,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-26 04:27:17,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 04:27:17,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:17,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-26 04:27:17,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 540 proven. 12530 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2021-08-26 04:27:19,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142387564] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:19,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:19,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29] total 36 [2021-08-26 04:27:19,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778511817] [2021-08-26 04:27:19,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-26 04:27:19,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-26 04:27:19,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2021-08-26 04:27:19,968 INFO L87 Difference]: Start difference. First operand 482 states and 491 transitions. Second operand has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:20,478 INFO L93 Difference]: Finished difference Result 621 states and 634 transitions. [2021-08-26 04:27:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-26 04:27:20,479 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 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 345 [2021-08-26 04:27:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:20,481 INFO L225 Difference]: With dead ends: 621 [2021-08-26 04:27:20,481 INFO L226 Difference]: Without dead ends: 551 [2021-08-26 04:27:20,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 715.4ms TimeCoverageRelationStatistics Valid=1064, Invalid=2016, Unknown=0, NotChecked=0, Total=3080 [2021-08-26 04:27:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-26 04:27:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2021-08-26 04:27:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.0200364298724955) internal successors, (560), 549 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 560 transitions. [2021-08-26 04:27:20,505 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 560 transitions. Word has length 345 [2021-08-26 04:27:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:20,506 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 560 transitions. [2021-08-26 04:27:20,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.833333333333333) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 560 transitions. [2021-08-26 04:27:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2021-08-26 04:27:20,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:20,508 INFO L512 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:20,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-08-26 04:27:20,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-08-26 04:27:20,717 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash 874288955, now seen corresponding path program 5 times [2021-08-26 04:27:20,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:20,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145942249] [2021-08-26 04:27:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:20,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2021-08-26 04:27:20,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:20,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145942249] [2021-08-26 04:27:20,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145942249] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:20,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297183371] [2021-08-26 04:27:20,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 04:27:20,888 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:20,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:20,889 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:20,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-26 04:27:23,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2021-08-26 04:27:23,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:23,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-26 04:27:23,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 580 proven. 18730 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2021-08-26 04:27:26,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297183371] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:26,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:26,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 31] total 39 [2021-08-26 04:27:26,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981841475] [2021-08-26 04:27:26,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-26 04:27:26,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-26 04:27:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1089, Unknown=0, NotChecked=0, Total=1482 [2021-08-26 04:27:26,052 INFO L87 Difference]: Start difference. First operand 550 states and 560 transitions. Second operand has 39 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 39 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:26,858 INFO L93 Difference]: Finished difference Result 689 states and 703 transitions. [2021-08-26 04:27:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-26 04:27:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 39 states have internal predecessors, (196), 0 states have call successors, (0), 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 413 [2021-08-26 04:27:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:26,861 INFO L225 Difference]: With dead ends: 689 [2021-08-26 04:27:26,861 INFO L226 Difference]: Without dead ends: 619 [2021-08-26 04:27:26,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 1029.9ms TimeCoverageRelationStatistics Valid=2182, Invalid=4138, Unknown=0, NotChecked=0, Total=6320 [2021-08-26 04:27:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-08-26 04:27:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2021-08-26 04:27:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.019448946515397) internal successors, (629), 617 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 629 transitions. [2021-08-26 04:27:26,892 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 629 transitions. Word has length 413 [2021-08-26 04:27:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:26,893 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 629 transitions. [2021-08-26 04:27:26,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.0256410256410255) internal successors, (196), 39 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 629 transitions. [2021-08-26 04:27:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2021-08-26 04:27:26,896 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:26,896 INFO L512 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:26,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-08-26 04:27:27,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-08-26 04:27:27,113 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2038719617, now seen corresponding path program 6 times [2021-08-26 04:27:27,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:27,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779067379] [2021-08-26 04:27:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:27,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2021-08-26 04:27:27,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:27,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779067379] [2021-08-26 04:27:27,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779067379] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:27,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297604412] [2021-08-26 04:27:27,288 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 04:27:27,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:27,293 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-26 04:27:30,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-08-26 04:27:30,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:30,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 04:27:30,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2021-08-26 04:27:33,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297604412] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:33,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:33,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-08-26 04:27:33,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075818203] [2021-08-26 04:27:33,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 04:27:33,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 04:27:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:27:33,077 INFO L87 Difference]: Start difference. First operand 618 states and 629 transitions. Second operand has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:33,185 INFO L93 Difference]: Finished difference Result 756 states and 771 transitions. [2021-08-26 04:27:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 04:27:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 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 481 [2021-08-26 04:27:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:33,188 INFO L225 Difference]: With dead ends: 756 [2021-08-26 04:27:33,188 INFO L226 Difference]: Without dead ends: 686 [2021-08-26 04:27:33,188 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 118.0ms TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 04:27:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-08-26 04:27:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-08-26 04:27:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.018978102189781) internal successors, (698), 685 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 698 transitions. [2021-08-26 04:27:33,212 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 698 transitions. Word has length 481 [2021-08-26 04:27:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:33,213 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 698 transitions. [2021-08-26 04:27:33,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 698 transitions. [2021-08-26 04:27:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2021-08-26 04:27:33,215 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:33,215 INFO L512 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:33,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-08-26 04:27:33,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:33,416 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2034417091, now seen corresponding path program 7 times [2021-08-26 04:27:33,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:33,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598203694] [2021-08-26 04:27:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:33,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2021-08-26 04:27:33,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:33,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598203694] [2021-08-26 04:27:33,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598203694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:33,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124427020] [2021-08-26 04:27:33,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 04:27:33,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:33,661 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:33,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-26 04:27:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:36,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 04:27:36,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2021-08-26 04:27:40,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124427020] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:40,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:40,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-26 04:27:40,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127270025] [2021-08-26 04:27:40,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 04:27:40,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 04:27:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 04:27:40,087 INFO L87 Difference]: Start difference. First operand 686 states and 698 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:40,189 INFO L93 Difference]: Finished difference Result 824 states and 840 transitions. [2021-08-26 04:27:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 04:27:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 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 549 [2021-08-26 04:27:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:40,192 INFO L225 Difference]: With dead ends: 824 [2021-08-26 04:27:40,193 INFO L226 Difference]: Without dead ends: 754 [2021-08-26 04:27:40,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 134.1ms TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 04:27:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-08-26 04:27:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2021-08-26 04:27:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.0185922974767596) internal successors, (767), 753 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 767 transitions. [2021-08-26 04:27:40,219 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 767 transitions. Word has length 549 [2021-08-26 04:27:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:40,220 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 767 transitions. [2021-08-26 04:27:40,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 767 transitions. [2021-08-26 04:27:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2021-08-26 04:27:40,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:40,224 INFO L512 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:40,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-26 04:27:40,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-08-26 04:27:40,424 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash -415039993, now seen corresponding path program 8 times [2021-08-26 04:27:40,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:40,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321057752] [2021-08-26 04:27:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:40,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2021-08-26 04:27:40,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:40,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321057752] [2021-08-26 04:27:40,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321057752] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:40,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296383993] [2021-08-26 04:27:40,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:27:40,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:40,657 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:40,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-26 04:27:43,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:27:43,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:43,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 04:27:43,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2021-08-26 04:27:47,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296383993] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:47,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:47,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-08-26 04:27:47,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058248204] [2021-08-26 04:27:47,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 04:27:47,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 04:27:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 04:27:47,679 INFO L87 Difference]: Start difference. First operand 754 states and 767 transitions. Second operand has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:47,795 INFO L93 Difference]: Finished difference Result 892 states and 909 transitions. [2021-08-26 04:27:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 04:27:47,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 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 617 [2021-08-26 04:27:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:47,801 INFO L225 Difference]: With dead ends: 892 [2021-08-26 04:27:47,801 INFO L226 Difference]: Without dead ends: 822 [2021-08-26 04:27:47,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 162.5ms TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 04:27:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-08-26 04:27:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2021-08-26 04:27:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.0182704019488429) internal successors, (836), 821 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 836 transitions. [2021-08-26 04:27:47,828 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 836 transitions. Word has length 617 [2021-08-26 04:27:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:47,829 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 836 transitions. [2021-08-26 04:27:47,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 836 transitions. [2021-08-26 04:27:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2021-08-26 04:27:47,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:47,833 INFO L512 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:47,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-26 04:27:48,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:48,033 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -758293429, now seen corresponding path program 9 times [2021-08-26 04:27:48,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:48,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762816223] [2021-08-26 04:27:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:48,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2021-08-26 04:27:48,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:48,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762816223] [2021-08-26 04:27:48,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762816223] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:48,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727925299] [2021-08-26 04:27:48,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:27:48,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:48,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:48,285 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:48,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-26 04:27:52,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-08-26 04:27:52,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:27:52,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-26 04:27:52,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:27:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2021-08-26 04:27:56,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727925299] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:56,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:27:56,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-08-26 04:27:56,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869641021] [2021-08-26 04:27:56,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-26 04:27:56,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:27:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-26 04:27:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=355, Unknown=0, NotChecked=0, Total=600 [2021-08-26 04:27:56,716 INFO L87 Difference]: Start difference. First operand 822 states and 836 transitions. Second operand has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:27:56,861 INFO L93 Difference]: Finished difference Result 960 states and 978 transitions. [2021-08-26 04:27:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 04:27:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 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 685 [2021-08-26 04:27:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:27:56,863 INFO L225 Difference]: With dead ends: 960 [2021-08-26 04:27:56,863 INFO L226 Difference]: Without dead ends: 890 [2021-08-26 04:27:56,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 185.7ms TimeCoverageRelationStatistics Valid=245, Invalid=355, Unknown=0, NotChecked=0, Total=600 [2021-08-26 04:27:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-08-26 04:27:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-08-26 04:27:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.0179977502812148) internal successors, (905), 889 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 905 transitions. [2021-08-26 04:27:56,902 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 905 transitions. Word has length 685 [2021-08-26 04:27:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:27:56,903 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 905 transitions. [2021-08-26 04:27:56,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:27:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 905 transitions. [2021-08-26 04:27:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2021-08-26 04:27:56,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:27:56,907 INFO L512 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:27:56,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-26 04:27:57,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-08-26 04:27:57,108 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:27:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:27:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1515005809, now seen corresponding path program 10 times [2021-08-26 04:27:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:27:57,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875673854] [2021-08-26 04:27:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:27:57,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:27:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:27:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2021-08-26 04:27:57,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:27:57,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875673854] [2021-08-26 04:27:57,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875673854] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:27:57,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801194641] [2021-08-26 04:27:57,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 04:27:57,402 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:27:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:27:57,405 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:27:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-26 04:28:01,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 04:28:01,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:28:01,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-26 04:28:01,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:28:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 552 proven. 68678 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2021-08-26 04:28:06,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801194641] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:06,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:28:06,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 35] total 48 [2021-08-26 04:28:06,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162635805] [2021-08-26 04:28:06,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-26 04:28:06,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:28:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-26 04:28:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2021-08-26 04:28:06,886 INFO L87 Difference]: Start difference. First operand 890 states and 905 transitions. Second operand has 48 states, 48 states have (on average 6.375) internal successors, (306), 48 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:28:07,397 INFO L93 Difference]: Finished difference Result 1029 states and 1048 transitions. [2021-08-26 04:28:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-26 04:28:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 6.375) internal successors, (306), 48 states have internal predecessors, (306), 0 states have call successors, (0), 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 753 [2021-08-26 04:28:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:28:07,399 INFO L225 Difference]: With dead ends: 1029 [2021-08-26 04:28:07,399 INFO L226 Difference]: Without dead ends: 959 [2021-08-26 04:28:07,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 908.7ms TimeCoverageRelationStatistics Valid=1499, Invalid=3057, Unknown=0, NotChecked=0, Total=4556 [2021-08-26 04:28:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-26 04:28:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2021-08-26 04:28:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.0177638453500522) internal successors, (974), 957 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 974 transitions. [2021-08-26 04:28:07,429 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 974 transitions. Word has length 753 [2021-08-26 04:28:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:28:07,429 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 974 transitions. [2021-08-26 04:28:07,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.375) internal successors, (306), 48 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 974 transitions. [2021-08-26 04:28:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2021-08-26 04:28:07,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:28:07,435 INFO L512 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:28:07,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-08-26 04:28:07,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-08-26 04:28:07,640 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:28:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:28:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1900311251, now seen corresponding path program 11 times [2021-08-26 04:28:07,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:28:07,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702459628] [2021-08-26 04:28:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:28:07,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:28:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2021-08-26 04:28:07,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:28:07,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702459628] [2021-08-26 04:28:07,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702459628] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:07,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106460198] [2021-08-26 04:28:07,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 04:28:07,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:28:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:28:07,977 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:28:07,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-26 04:28:13,260 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 110 check-sat command(s) [2021-08-26 04:28:13,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:28:13,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-26 04:28:13,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:28:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 592 proven. 82366 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2021-08-26 04:28:18,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106460198] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:18,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:28:18,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 37] total 51 [2021-08-26 04:28:18,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740915553] [2021-08-26 04:28:18,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-08-26 04:28:18,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:28:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-26 04:28:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=1944, Unknown=0, NotChecked=0, Total=2550 [2021-08-26 04:28:18,744 INFO L87 Difference]: Start difference. First operand 958 states and 974 transitions. Second operand has 51 states, 51 states have (on average 6.431372549019608) internal successors, (328), 51 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:28:19,625 INFO L93 Difference]: Finished difference Result 1097 states and 1117 transitions. [2021-08-26 04:28:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-08-26 04:28:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.431372549019608) internal successors, (328), 51 states have internal predecessors, (328), 0 states have call successors, (0), 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 821 [2021-08-26 04:28:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:28:19,627 INFO L225 Difference]: With dead ends: 1097 [2021-08-26 04:28:19,627 INFO L226 Difference]: Without dead ends: 1027 [2021-08-26 04:28:19,628 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 1309.9ms TimeCoverageRelationStatistics Valid=2887, Invalid=5485, Unknown=0, NotChecked=0, Total=8372 [2021-08-26 04:28:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-08-26 04:28:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1026. [2021-08-26 04:28:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.0175609756097561) internal successors, (1043), 1025 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1043 transitions. [2021-08-26 04:28:19,661 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1043 transitions. Word has length 821 [2021-08-26 04:28:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:28:19,662 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1043 transitions. [2021-08-26 04:28:19,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.431372549019608) internal successors, (328), 51 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1043 transitions. [2021-08-26 04:28:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2021-08-26 04:28:19,668 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:28:19,668 INFO L512 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:28:19,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-08-26 04:28:19,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-08-26 04:28:19,870 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:28:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:28:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash 777202455, now seen corresponding path program 12 times [2021-08-26 04:28:19,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:28:19,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732261996] [2021-08-26 04:28:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:28:19,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:28:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2021-08-26 04:28:20,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:28:20,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732261996] [2021-08-26 04:28:20,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732261996] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:20,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053858150] [2021-08-26 04:28:20,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 04:28:20,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:28:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:28:20,226 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:28:20,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-26 04:28:26,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 131 check-sat command(s) [2021-08-26 04:28:26,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:28:26,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 04:28:26,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:28:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2021-08-26 04:28:31,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053858150] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:31,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:28:31,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-08-26 04:28:31,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768005850] [2021-08-26 04:28:31,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-26 04:28:31,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:28:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-26 04:28:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2021-08-26 04:28:31,684 INFO L87 Difference]: Start difference. First operand 1026 states and 1043 transitions. Second operand has 31 states, 31 states have (on average 9.35483870967742) internal successors, (290), 30 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:28:31,833 INFO L93 Difference]: Finished difference Result 1164 states and 1185 transitions. [2021-08-26 04:28:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 04:28:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.35483870967742) internal successors, (290), 30 states have internal predecessors, (290), 0 states have call successors, (0), 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 889 [2021-08-26 04:28:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:28:31,836 INFO L225 Difference]: With dead ends: 1164 [2021-08-26 04:28:31,836 INFO L226 Difference]: Without dead ends: 1094 [2021-08-26 04:28:31,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 257.8ms TimeCoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2021-08-26 04:28:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-08-26 04:28:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2021-08-26 04:28:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 1.0173833485818846) internal successors, (1112), 1093 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1112 transitions. [2021-08-26 04:28:31,871 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1112 transitions. Word has length 889 [2021-08-26 04:28:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:28:31,871 INFO L470 AbstractCegarLoop]: Abstraction has 1094 states and 1112 transitions. [2021-08-26 04:28:31,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.35483870967742) internal successors, (290), 30 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1112 transitions. [2021-08-26 04:28:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2021-08-26 04:28:31,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:28:31,878 INFO L512 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:28:31,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2021-08-26 04:28:32,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-08-26 04:28:32,078 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:28:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:28:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash -47185573, now seen corresponding path program 13 times [2021-08-26 04:28:32,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:28:32,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991796924] [2021-08-26 04:28:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:28:32,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:28:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2021-08-26 04:28:32,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:28:32,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991796924] [2021-08-26 04:28:32,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991796924] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:32,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403100109] [2021-08-26 04:28:32,454 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 04:28:32,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:28:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:28:32,455 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:28:32,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-26 04:28:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:38,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 04:28:38,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:28:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2021-08-26 04:28:44,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403100109] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:44,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:28:44,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-08-26 04:28:44,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381603723] [2021-08-26 04:28:44,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-26 04:28:44,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:28:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-26 04:28:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 04:28:44,474 INFO L87 Difference]: Start difference. First operand 1094 states and 1112 transitions. Second operand has 33 states, 33 states have (on average 9.454545454545455) internal successors, (312), 32 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:28:44,679 INFO L93 Difference]: Finished difference Result 1232 states and 1254 transitions. [2021-08-26 04:28:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 04:28:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 9.454545454545455) internal successors, (312), 32 states have internal predecessors, (312), 0 states have call successors, (0), 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 957 [2021-08-26 04:28:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:28:44,682 INFO L225 Difference]: With dead ends: 1232 [2021-08-26 04:28:44,682 INFO L226 Difference]: Without dead ends: 1162 [2021-08-26 04:28:44,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 286.7ms TimeCoverageRelationStatistics Valid=423, Invalid=633, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 04:28:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2021-08-26 04:28:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2021-08-26 04:28:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.0172265288544358) internal successors, (1181), 1161 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1181 transitions. [2021-08-26 04:28:44,732 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1181 transitions. Word has length 957 [2021-08-26 04:28:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:28:44,733 INFO L470 AbstractCegarLoop]: Abstraction has 1162 states and 1181 transitions. [2021-08-26 04:28:44,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.454545454545455) internal successors, (312), 32 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1181 transitions. [2021-08-26 04:28:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2021-08-26 04:28:44,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:28:44,743 INFO L512 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:28:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2021-08-26 04:28:44,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-08-26 04:28:44,965 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:28:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:28:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1705768351, now seen corresponding path program 14 times [2021-08-26 04:28:44,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:28:44,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972473343] [2021-08-26 04:28:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:28:44,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:28:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2021-08-26 04:28:45,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:28:45,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972473343] [2021-08-26 04:28:45,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972473343] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:45,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103427544] [2021-08-26 04:28:45,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 04:28:45,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:28:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:28:45,435 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:28:45,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-26 04:28:52,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 04:28:52,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:28:52,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 04:28:52,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:28:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2021-08-26 04:28:58,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103427544] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:58,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:28:58,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-08-26 04:28:58,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283086365] [2021-08-26 04:28:58,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-26 04:28:58,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:28:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-26 04:28:58,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2021-08-26 04:28:58,653 INFO L87 Difference]: Start difference. First operand 1162 states and 1181 transitions. Second operand has 35 states, 35 states have (on average 9.542857142857143) internal successors, (334), 34 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:28:58,811 INFO L93 Difference]: Finished difference Result 1300 states and 1323 transitions. [2021-08-26 04:28:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 04:28:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 9.542857142857143) internal successors, (334), 34 states have internal predecessors, (334), 0 states have call successors, (0), 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 1025 [2021-08-26 04:28:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:28:58,813 INFO L225 Difference]: With dead ends: 1300 [2021-08-26 04:28:58,813 INFO L226 Difference]: Without dead ends: 1230 [2021-08-26 04:28:58,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 313.1ms TimeCoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2021-08-26 04:28:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-08-26 04:28:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2021-08-26 04:28:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.017087062652563) internal successors, (1250), 1229 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1250 transitions. [2021-08-26 04:28:58,849 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1250 transitions. Word has length 1025 [2021-08-26 04:28:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:28:58,850 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1250 transitions. [2021-08-26 04:28:58,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.542857142857143) internal successors, (334), 34 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:28:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1250 transitions. [2021-08-26 04:28:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2021-08-26 04:28:58,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:28:58,858 INFO L512 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:28:58,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-08-26 04:28:59,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-08-26 04:28:59,059 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:28:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:28:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1760032797, now seen corresponding path program 15 times [2021-08-26 04:28:59,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:28:59,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483606060] [2021-08-26 04:28:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:28:59,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:28:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:28:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2021-08-26 04:28:59,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:28:59,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483606060] [2021-08-26 04:28:59,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483606060] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:28:59,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904354291] [2021-08-26 04:28:59,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 04:28:59,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:28:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:28:59,507 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:28:59,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-08-26 04:29:07,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2021-08-26 04:29:07,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:29:07,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 04:29:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:29:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2021-08-26 04:29:14,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904354291] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:14,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:29:14,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2021-08-26 04:29:14,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693990796] [2021-08-26 04:29:14,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-26 04:29:14,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:29:14,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-26 04:29:14,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2021-08-26 04:29:14,306 INFO L87 Difference]: Start difference. First operand 1230 states and 1250 transitions. Second operand has 37 states, 37 states have (on average 9.621621621621621) internal successors, (356), 36 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:29:14,492 INFO L93 Difference]: Finished difference Result 1368 states and 1392 transitions. [2021-08-26 04:29:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-26 04:29:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 9.621621621621621) internal successors, (356), 36 states have internal predecessors, (356), 0 states have call successors, (0), 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 1093 [2021-08-26 04:29:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:29:14,495 INFO L225 Difference]: With dead ends: 1368 [2021-08-26 04:29:14,495 INFO L226 Difference]: Without dead ends: 1298 [2021-08-26 04:29:14,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 348.9ms TimeCoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2021-08-26 04:29:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2021-08-26 04:29:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2021-08-26 04:29:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.0169622205088666) internal successors, (1319), 1297 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1319 transitions. [2021-08-26 04:29:14,534 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1319 transitions. Word has length 1093 [2021-08-26 04:29:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:29:14,535 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 1319 transitions. [2021-08-26 04:29:14,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.621621621621621) internal successors, (356), 36 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1319 transitions. [2021-08-26 04:29:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1162 [2021-08-26 04:29:14,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:29:14,545 INFO L512 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:29:14,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-08-26 04:29:14,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-08-26 04:29:14,769 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:29:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:29:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1471858649, now seen corresponding path program 16 times [2021-08-26 04:29:14,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:29:14,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663817923] [2021-08-26 04:29:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:29:14,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:29:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:29:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2021-08-26 04:29:15,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:29:15,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663817923] [2021-08-26 04:29:15,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663817923] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:15,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646931554] [2021-08-26 04:29:15,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 04:29:15,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:29:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:29:15,289 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:29:15,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-08-26 04:29:24,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 04:29:24,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:29:24,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-26 04:29:24,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:29:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 564 proven. 169754 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2021-08-26 04:29:31,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646931554] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:31,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:29:31,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 41] total 60 [2021-08-26 04:29:31,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049225620] [2021-08-26 04:29:31,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-08-26 04:29:31,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:29:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-08-26 04:29:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2698, Unknown=0, NotChecked=0, Total=3540 [2021-08-26 04:29:31,800 INFO L87 Difference]: Start difference. First operand 1298 states and 1319 transitions. Second operand has 60 states, 60 states have (on average 7.3) internal successors, (438), 60 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:29:32,385 INFO L93 Difference]: Finished difference Result 1437 states and 1462 transitions. [2021-08-26 04:29:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-26 04:29:32,386 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 7.3) internal successors, (438), 60 states have internal predecessors, (438), 0 states have call successors, (0), 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 1161 [2021-08-26 04:29:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:29:32,388 INFO L225 Difference]: With dead ends: 1437 [2021-08-26 04:29:32,388 INFO L226 Difference]: Without dead ends: 1367 [2021-08-26 04:29:32,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1205.3ms TimeCoverageRelationStatistics Valid=2042, Invalid=4278, Unknown=0, NotChecked=0, Total=6320 [2021-08-26 04:29:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2021-08-26 04:29:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1366. [2021-08-26 04:29:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 1.0168498168498168) internal successors, (1388), 1365 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1388 transitions. [2021-08-26 04:29:32,429 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1388 transitions. Word has length 1161 [2021-08-26 04:29:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:29:32,429 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 1388 transitions. [2021-08-26 04:29:32,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 7.3) internal successors, (438), 60 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1388 transitions. [2021-08-26 04:29:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2021-08-26 04:29:32,439 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:29:32,439 INFO L512 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:29:32,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2021-08-26 04:29:32,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:29:32,640 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:29:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:29:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -679180693, now seen corresponding path program 17 times [2021-08-26 04:29:32,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:29:32,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990815010] [2021-08-26 04:29:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:29:32,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:29:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:29:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2021-08-26 04:29:33,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:29:33,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990815010] [2021-08-26 04:29:33,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990815010] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:33,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5814972] [2021-08-26 04:29:33,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 04:29:33,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:29:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:29:33,209 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:29:33,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-08-26 04:29:43,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2021-08-26 04:29:43,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:29:43,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-26 04:29:43,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:29:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 604 proven. 190930 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2021-08-26 04:29:51,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5814972] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:51,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:29:51,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 43] total 63 [2021-08-26 04:29:51,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103624116] [2021-08-26 04:29:51,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-08-26 04:29:51,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:29:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-08-26 04:29:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=3015, Unknown=0, NotChecked=0, Total=3906 [2021-08-26 04:29:51,325 INFO L87 Difference]: Start difference. First operand 1366 states and 1388 transitions. Second operand has 63 states, 63 states have (on average 7.301587301587301) internal successors, (460), 63 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:29:52,796 INFO L93 Difference]: Finished difference Result 1505 states and 1531 transitions. [2021-08-26 04:29:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-08-26 04:29:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 7.301587301587301) internal successors, (460), 63 states have internal predecessors, (460), 0 states have call successors, (0), 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 1229 [2021-08-26 04:29:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:29:52,798 INFO L225 Difference]: With dead ends: 1505 [2021-08-26 04:29:52,798 INFO L226 Difference]: Without dead ends: 1435 [2021-08-26 04:29:52,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1188 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4019 ImplicationChecksByTransitivity, 1911.0ms TimeCoverageRelationStatistics Valid=5366, Invalid=10134, Unknown=0, NotChecked=0, Total=15500 [2021-08-26 04:29:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2021-08-26 04:29:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1434. [2021-08-26 04:29:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1433 states have (on average 1.0167480809490579) internal successors, (1457), 1433 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1457 transitions. [2021-08-26 04:29:52,842 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1457 transitions. Word has length 1229 [2021-08-26 04:29:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:29:52,843 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1457 transitions. [2021-08-26 04:29:52,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 7.301587301587301) internal successors, (460), 63 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:29:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1457 transitions. [2021-08-26 04:29:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2021-08-26 04:29:52,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:29:52,853 INFO L512 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:29:52,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-08-26 04:29:53,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-08-26 04:29:53,054 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:29:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:29:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -895028561, now seen corresponding path program 18 times [2021-08-26 04:29:53,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:29:53,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842800127] [2021-08-26 04:29:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:29:53,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:29:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 04:29:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2021-08-26 04:29:53,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 04:29:53,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842800127] [2021-08-26 04:29:53,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842800127] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:29:53,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954903531] [2021-08-26 04:29:53,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 04:29:53,701 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:29:53,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 04:29:53,702 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 04:29:53,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-08-26 04:30:04,667 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2021-08-26 04:30:04,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 04:30:04,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 04:30:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 04:30:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2021-08-26 04:30:13,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954903531] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 04:30:13,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 04:30:13,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2021-08-26 04:30:13,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708101679] [2021-08-26 04:30:13,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-08-26 04:30:13,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 04:30:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-26 04:30:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1093, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 04:30:13,410 INFO L87 Difference]: Start difference. First operand 1434 states and 1457 transitions. Second operand has 43 states, 43 states have (on average 9.813953488372093) internal successors, (422), 42 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:30:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 04:30:13,623 INFO L93 Difference]: Finished difference Result 1572 states and 1599 transitions. [2021-08-26 04:30:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-26 04:30:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 9.813953488372093) internal successors, (422), 42 states have internal predecessors, (422), 0 states have call successors, (0), 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 1297 [2021-08-26 04:30:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 04:30:13,626 INFO L225 Difference]: With dead ends: 1572 [2021-08-26 04:30:13,626 INFO L226 Difference]: Without dead ends: 1502 [2021-08-26 04:30:13,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 466.8ms TimeCoverageRelationStatistics Valid=713, Invalid=1093, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 04:30:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2021-08-26 04:30:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2021-08-26 04:30:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 1.016655562958028) internal successors, (1526), 1501 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:30:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1526 transitions. [2021-08-26 04:30:13,669 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1526 transitions. Word has length 1297 [2021-08-26 04:30:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 04:30:13,670 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 1526 transitions. [2021-08-26 04:30:13,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.813953488372093) internal successors, (422), 42 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 04:30:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1526 transitions. [2021-08-26 04:30:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2021-08-26 04:30:13,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 04:30:13,681 INFO L512 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 04:30:13,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-08-26 04:30:13,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 04:30:13,882 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 04:30:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 04:30:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -822248205, now seen corresponding path program 19 times [2021-08-26 04:30:13,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 04:30:13,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994872463] [2021-08-26 04:30:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 04:30:13,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 04:30:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 04:30:14,121 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 04:30:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 04:30:14,627 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 04:30:14,627 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 04:30:14,628 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 04:30:14,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-26 04:30:14,637 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 04:30:14,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 04:30:14 BoogieIcfgContainer [2021-08-26 04:30:14,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 04:30:14,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 04:30:14,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 04:30:14,935 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 04:30:14,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:25:54" (3/4) ... [2021-08-26 04:30:14,937 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 04:30:15,231 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 04:30:15,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 04:30:15,233 INFO L168 Benchmark]: Toolchain (without parser) took 261744.93 ms. Allocated memory was 58.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 37.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,233 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 04:30:15,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.40 ms. Allocated memory is still 58.7 MB. Free memory was 37.6 MB in the beginning and 27.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 58.7 MB. Free memory was 27.9 MB in the beginning and 26.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,234 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 58.7 MB. Free memory was 26.3 MB in the beginning and 42.9 MB in the end (delta: -16.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,234 INFO L168 Benchmark]: RCFGBuilder took 376.65 ms. Allocated memory is still 58.7 MB. Free memory was 42.9 MB in the beginning and 28.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,235 INFO L168 Benchmark]: TraceAbstraction took 260779.74 ms. Allocated memory was 58.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 28.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,236 INFO L168 Benchmark]: Witness Printer took 296.39 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 16.1 GB. [2021-08-26 04:30:15,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 213.40 ms. Allocated memory is still 58.7 MB. Free memory was 37.6 MB in the beginning and 27.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 58.7 MB. Free memory was 27.9 MB in the beginning and 26.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 58.7 MB. Free memory was 26.3 MB in the beginning and 42.9 MB in the end (delta: -16.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 376.65 ms. Allocated memory is still 58.7 MB. Free memory was 42.9 MB in the beginning and 28.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 260779.74 ms. Allocated memory was 58.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 28.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 296.39 ms. Allocated memory is still 2.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L6] COND FALSE !(!cond) VAL [last=22, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND FALSE !(d == SIZE) VAL [last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [last=22, SIZE=20] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND TRUE c=last) VAL [last=22, SIZE=20] [L25] c++ VAL [last=22, SIZE=20] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [last=22, SIZE=20] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [last=22, SIZE=20] [L11] COND TRUE !(cond) VAL [last=22, SIZE=20] [L12] reach_error() VAL [last=22, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 260418.9ms, OverallIterations: 55, TraceHistogramMax: 400, EmptinessCheckTime: 140.4ms, AutomataDifference: 31488.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 756 SDtfs, 11102 SDslu, 3334 SDs, 0 SdLazy, 15137 SolverSat, 1694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7252.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16863 GetRequests, 14566 SyntacticMatches, 2 SemanticMatches, 2295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60073 ImplicationChecksByTransitivity, 35007.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1714occurred in iteration=34, InterpolantAutomatonStates: 1514, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1948.9ms AutomataMinimizationTime, 54 MinimizatonAttempts, 6839 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1065.0ms SsaConstructionTime, 7317.4ms SatisfiabilityAnalysisTime, 111525.0ms InterpolantComputationTime, 31971 NumberOfCodeBlocks, 30611 NumberOfCodeBlocksAsserted, 1089 NumberOfCheckSat, 30506 ConstructedInterpolants, 0 QuantifiedInterpolants, 178480 SizeOfPredicates, 133 NumberOfNonLiveVariables, 23583 ConjunctsInSsa, 800 ConjunctsInUnsatCore, 100 InterpolantComputations, 12 PerfectInterpolantSequences, 253176/3128819 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 04:30:15,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...