./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 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/pthread-wmm/mix046_tso.opt.i -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 0770180054bb5b5be028b0dcba7450a3cf644c37 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-96f1638 [2020-12-02 11:58:15,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:58:15,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:58:15,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:58:15,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:58:15,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:58:15,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:58:15,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:58:15,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:58:15,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:58:15,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:58:15,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:58:15,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:58:15,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:58:15,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:58:15,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:58:15,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:58:15,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:58:15,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:58:15,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:58:15,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:58:15,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:58:15,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:58:15,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:58:15,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:58:15,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:58:15,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:58:15,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:58:15,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:58:15,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:58:15,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:58:15,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:58:15,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:58:15,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:58:15,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:58:15,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:58:15,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:58:15,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:58:15,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:58:15,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:58:15,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:58:15,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 11:58:15,243 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:58:15,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:58:15,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:58:15,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:58:15,246 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:58:15,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:58:15,247 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:58:15,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:58:15,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:58:15,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:58:15,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:58:15,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:58:15,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:58:15,249 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:58:15,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:58:15,249 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:58:15,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:58:15,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:58:15,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:58:15,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:58:15,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:58:15,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:58:15,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:58:15,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:58:15,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:58:15,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:58:15,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:58:15,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:58:15,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:58:15,253 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 -> 0770180054bb5b5be028b0dcba7450a3cf644c37 [2020-12-02 11:58:15,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:58:15,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:58:15,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:58:15,723 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:58:15,732 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:58:15,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i [2020-12-02 11:58:15,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea7145ef/a1174bc966ee49869456f72d314f3e1d/FLAG9dd8efadc [2020-12-02 11:58:16,560 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:58:16,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i [2020-12-02 11:58:16,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea7145ef/a1174bc966ee49869456f72d314f3e1d/FLAG9dd8efadc [2020-12-02 11:58:16,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea7145ef/a1174bc966ee49869456f72d314f3e1d [2020-12-02 11:58:16,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:58:16,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:58:16,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:58:16,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:58:16,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:58:16,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:58:16" (1/1) ... [2020-12-02 11:58:16,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c91ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:16, skipping insertion in model container [2020-12-02 11:58:16,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:58:16" (1/1) ... [2020-12-02 11:58:16,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:58:17,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:58:17,199 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i[948,961] [2020-12-02 11:58:17,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:58:17,548 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:58:17,580 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_tso.opt.i[948,961] [2020-12-02 11:58:17,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:58:17,829 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:58:17,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17 WrapperNode [2020-12-02 11:58:17,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:58:17,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:58:17,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:58:17,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:58:17,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:17,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:17,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:58:17,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:58:17,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:58:17,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:58:17,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:17,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:17,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:17,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:18,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:18,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:18,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... [2020-12-02 11:58:18,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:58:18,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:58:18,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:58:18,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:58:18,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:58:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:58:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:58:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:58:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:58:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 11:58:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 11:58:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-02 11:58:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-02 11:58:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:58:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:58:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:58:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:58:18,137 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 11:58:20,269 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:58:20,269 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:58:20,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:20 BoogieIcfgContainer [2020-12-02 11:58:20,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:58:20,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:58:20,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:58:20,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:58:20,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:58:16" (1/3) ... [2020-12-02 11:58:20,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a05d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:58:20, skipping insertion in model container [2020-12-02 11:58:20,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:17" (2/3) ... [2020-12-02 11:58:20,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a05d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:58:20, skipping insertion in model container [2020-12-02 11:58:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:20" (3/3) ... [2020-12-02 11:58:20,283 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2020-12-02 11:58:20,301 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:58:20,301 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:58:20,306 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:58:20,307 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:58:20,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,356 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,356 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,359 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,359 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,366 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,367 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,367 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,368 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,368 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,368 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,381 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,388 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,389 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:58:20,393 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:58:20,407 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-02 11:58:20,432 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:58:20,432 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:58:20,432 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:58:20,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:58:20,433 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:58:20,433 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:58:20,433 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:58:20,454 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:58:20,471 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:58:20,474 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-02 11:58:20,477 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-02 11:58:20,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2020-12-02 11:58:20,538 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2020-12-02 11:58:20,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:58:20,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-02 11:58:20,549 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2020-12-02 11:58:20,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:20,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:20,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:20,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:20,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:20,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:20,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:20,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:20,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:22,186 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-12-02 11:58:23,272 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2020-12-02 11:58:25,629 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-12-02 11:58:26,724 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 267 [2020-12-02 11:58:26,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:58:26,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:26,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:58:26,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:26,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:26,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:26,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:26,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:27,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:27,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:27,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:27,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:27,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:27,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:27,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:27,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 11:58:27,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:27,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:27,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:27,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:27,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:27,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:27,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:28,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:28,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 11:58:28,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:28,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:28,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:28,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:28,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:28,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:28,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-02 11:58:28,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-02 11:58:28,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-02 11:58:28,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:28,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:28,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:28,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:58:28,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:28,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:28,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-02 11:58:28,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:29,215 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 11:58:29,335 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 11:58:29,885 WARN L197 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 11:58:30,112 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 11:58:30,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:30,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:30,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 11:58:30,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:30,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:30,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:30,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:30,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:30,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:30,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:30,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:58:30,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:30,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:31,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:58:31,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-02 11:58:31,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:31,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:31,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:31,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:31,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:31,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 11:58:31,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 11:58:31,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:31,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:31,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:31,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:31,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,073 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 11:58:32,294 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 11:58:32,523 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 11:58:32,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:32,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:32,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:32,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:32,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:32,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:32,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:32,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:32,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:58:32,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:58:32,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:32,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:32,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:32,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:32,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:32,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:32,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:32,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:32,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:32,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:32,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:32,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:33,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:33,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:33,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:33,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:33,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:33,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:33,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:33,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:34,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:34,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:34,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:34,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:34,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:34,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:34,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:34,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:34,316 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-02 11:58:34,530 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-02 11:58:35,159 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-02 11:58:35,707 WARN L197 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-02 11:58:36,757 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 270 [2020-12-02 11:58:37,841 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 270 [2020-12-02 11:58:37,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:58:37,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:37,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:58:37,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:37,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:37,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:37,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:37,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:38,399 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-02 11:58:38,530 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-02 11:58:38,673 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-02 11:58:38,802 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-02 11:58:39,413 WARN L197 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-02 11:58:39,685 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-02 11:58:40,246 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-02 11:58:40,513 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-02 11:58:41,344 WARN L197 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-02 11:58:42,188 WARN L197 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-02 11:58:44,697 WARN L197 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 286 DAG size of output: 285 [2020-12-02 11:58:46,046 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 285 [2020-12-02 11:58:46,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 11:58:46,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 11:58:46,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-02 11:58:46,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-02 11:58:46,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:46,553 INFO L131 LiptonReduction]: Checked pairs total: 7778 [2020-12-02 11:58:46,554 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-12-02 11:58:46,560 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-02 11:58:46,815 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-12-02 11:58:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-12-02 11:58:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:58:46,826 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:46,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:46,827 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1566809842, now seen corresponding path program 1 times [2020-12-02 11:58:46,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:46,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502607617] [2020-12-02 11:58:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:47,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502607617] [2020-12-02 11:58:47,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:47,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:58:47,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150858025] [2020-12-02 11:58:47,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:47,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:47,241 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-12-02 11:58:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:47,380 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-02 11:58:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:47,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 11:58:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:47,427 INFO L225 Difference]: With dead ends: 2602 [2020-12-02 11:58:47,427 INFO L226 Difference]: Without dead ends: 2122 [2020-12-02 11:58:47,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-12-02 11:58:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-12-02 11:58:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-12-02 11:58:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-12-02 11:58:47,619 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-12-02 11:58:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:47,620 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-12-02 11:58:47,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-12-02 11:58:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 11:58:47,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:47,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:47,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:58:47,628 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1829199143, now seen corresponding path program 1 times [2020-12-02 11:58:47,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:47,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685264140] [2020-12-02 11:58:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:47,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685264140] [2020-12-02 11:58:47,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:47,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:58:47,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615616594] [2020-12-02 11:58:47,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:47,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:47,864 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-12-02 11:58:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:47,898 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-12-02 11:58:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:47,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-02 11:58:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:47,920 INFO L225 Difference]: With dead ends: 1962 [2020-12-02 11:58:47,920 INFO L226 Difference]: Without dead ends: 1962 [2020-12-02 11:58:47,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-12-02 11:58:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-12-02 11:58:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-12-02 11:58:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-12-02 11:58:48,012 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 11 [2020-12-02 11:58:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:48,012 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-12-02 11:58:48,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-12-02 11:58:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 11:58:48,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:48,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:48,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:58:48,020 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1251307991, now seen corresponding path program 1 times [2020-12-02 11:58:48,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:48,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130483637] [2020-12-02 11:58:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:48,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130483637] [2020-12-02 11:58:48,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:48,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:48,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836888194] [2020-12-02 11:58:48,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:48,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:48,252 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 4 states. [2020-12-02 11:58:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:48,403 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-12-02 11:58:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:48,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 11:58:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:48,434 INFO L225 Difference]: With dead ends: 1898 [2020-12-02 11:58:48,434 INFO L226 Difference]: Without dead ends: 1898 [2020-12-02 11:58:48,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-12-02 11:58:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-12-02 11:58:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-12-02 11:58:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-12-02 11:58:48,552 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-12-02 11:58:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:48,552 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-12-02 11:58:48,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-12-02 11:58:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:58:48,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:48,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:48,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:58:48,558 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 367122832, now seen corresponding path program 1 times [2020-12-02 11:58:48,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:48,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677379067] [2020-12-02 11:58:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:48,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677379067] [2020-12-02 11:58:48,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:48,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:58:48,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137229617] [2020-12-02 11:58:48,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:48,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:48,751 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 5 states. [2020-12-02 11:58:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:48,875 INFO L93 Difference]: Finished difference Result 2058 states and 7760 transitions. [2020-12-02 11:58:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:48,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-02 11:58:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:48,899 INFO L225 Difference]: With dead ends: 2058 [2020-12-02 11:58:48,899 INFO L226 Difference]: Without dead ends: 2058 [2020-12-02 11:58:48,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2020-12-02 11:58:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2020-12-02 11:58:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2020-12-02 11:58:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7760 transitions. [2020-12-02 11:58:48,998 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7760 transitions. Word has length 15 [2020-12-02 11:58:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:48,998 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 7760 transitions. [2020-12-02 11:58:48,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7760 transitions. [2020-12-02 11:58:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:58:49,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:49,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:49,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:58:49,006 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash 399650512, now seen corresponding path program 2 times [2020-12-02 11:58:49,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:49,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669080838] [2020-12-02 11:58:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:49,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669080838] [2020-12-02 11:58:49,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:49,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:49,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680483323] [2020-12-02 11:58:49,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:58:49,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:58:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:49,277 INFO L87 Difference]: Start difference. First operand 2058 states and 7760 transitions. Second operand 6 states. [2020-12-02 11:58:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:49,424 INFO L93 Difference]: Finished difference Result 2394 states and 8984 transitions. [2020-12-02 11:58:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:49,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 11:58:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:49,449 INFO L225 Difference]: With dead ends: 2394 [2020-12-02 11:58:49,450 INFO L226 Difference]: Without dead ends: 2394 [2020-12-02 11:58:49,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-12-02 11:58:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2330. [2020-12-02 11:58:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2330 states. [2020-12-02 11:58:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 8760 transitions. [2020-12-02 11:58:49,591 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 8760 transitions. Word has length 15 [2020-12-02 11:58:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:49,591 INFO L481 AbstractCegarLoop]: Abstraction has 2330 states and 8760 transitions. [2020-12-02 11:58:49,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:58:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 8760 transitions. [2020-12-02 11:58:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:58:49,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:49,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:49,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:58:49,597 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash -294535880, now seen corresponding path program 3 times [2020-12-02 11:58:49,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:49,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954423764] [2020-12-02 11:58:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:49,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954423764] [2020-12-02 11:58:49,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:49,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:58:49,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352648081] [2020-12-02 11:58:49,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:49,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:49,805 INFO L87 Difference]: Start difference. First operand 2330 states and 8760 transitions. Second operand 5 states. [2020-12-02 11:58:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:49,941 INFO L93 Difference]: Finished difference Result 2426 states and 9064 transitions. [2020-12-02 11:58:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:58:49,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-02 11:58:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:49,966 INFO L225 Difference]: With dead ends: 2426 [2020-12-02 11:58:49,967 INFO L226 Difference]: Without dead ends: 2426 [2020-12-02 11:58:49,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-12-02 11:58:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2250. [2020-12-02 11:58:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-12-02 11:58:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8368 transitions. [2020-12-02 11:58:50,055 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8368 transitions. Word has length 15 [2020-12-02 11:58:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:50,055 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 8368 transitions. [2020-12-02 11:58:50,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8368 transitions. [2020-12-02 11:58:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 11:58:50,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:50,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:50,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:58:50,060 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 13681864, now seen corresponding path program 1 times [2020-12-02 11:58:50,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:50,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367743325] [2020-12-02 11:58:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:50,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367743325] [2020-12-02 11:58:50,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:50,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:58:50,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142627909] [2020-12-02 11:58:50,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:50,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:50,144 INFO L87 Difference]: Start difference. First operand 2250 states and 8368 transitions. Second operand 3 states. [2020-12-02 11:58:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:50,176 INFO L93 Difference]: Finished difference Result 2234 states and 8300 transitions. [2020-12-02 11:58:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:50,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-02 11:58:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:50,193 INFO L225 Difference]: With dead ends: 2234 [2020-12-02 11:58:50,193 INFO L226 Difference]: Without dead ends: 2234 [2020-12-02 11:58:50,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-12-02 11:58:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2020-12-02 11:58:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2020-12-02 11:58:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 8300 transitions. [2020-12-02 11:58:50,290 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 8300 transitions. Word has length 15 [2020-12-02 11:58:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:50,290 INFO L481 AbstractCegarLoop]: Abstraction has 2234 states and 8300 transitions. [2020-12-02 11:58:50,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 8300 transitions. [2020-12-02 11:58:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:58:50,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:50,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:50,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:58:50,297 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1563755043, now seen corresponding path program 1 times [2020-12-02 11:58:50,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:50,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410853745] [2020-12-02 11:58:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:50,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410853745] [2020-12-02 11:58:50,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:50,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:50,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011330253] [2020-12-02 11:58:50,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:58:50,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:58:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:50,514 INFO L87 Difference]: Start difference. First operand 2234 states and 8300 transitions. Second operand 6 states. [2020-12-02 11:58:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:50,667 INFO L93 Difference]: Finished difference Result 2682 states and 10012 transitions. [2020-12-02 11:58:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:50,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 11:58:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:50,685 INFO L225 Difference]: With dead ends: 2682 [2020-12-02 11:58:50,685 INFO L226 Difference]: Without dead ends: 2682 [2020-12-02 11:58:50,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-12-02 11:58:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2394. [2020-12-02 11:58:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-12-02 11:58:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8956 transitions. [2020-12-02 11:58:50,802 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8956 transitions. Word has length 16 [2020-12-02 11:58:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:50,803 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 8956 transitions. [2020-12-02 11:58:50,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:58:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8956 transitions. [2020-12-02 11:58:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:58:50,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:50,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:50,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:58:50,810 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash -495797913, now seen corresponding path program 2 times [2020-12-02 11:58:50,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:50,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509941993] [2020-12-02 11:58:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:51,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509941993] [2020-12-02 11:58:51,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:51,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:58:51,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270012009] [2020-12-02 11:58:51,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:58:51,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:58:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:51,004 INFO L87 Difference]: Start difference. First operand 2394 states and 8956 transitions. Second operand 7 states. [2020-12-02 11:58:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:51,171 INFO L93 Difference]: Finished difference Result 2826 states and 10468 transitions. [2020-12-02 11:58:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:51,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-02 11:58:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:51,188 INFO L225 Difference]: With dead ends: 2826 [2020-12-02 11:58:51,189 INFO L226 Difference]: Without dead ends: 2826 [2020-12-02 11:58:51,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2020-12-02 11:58:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2378. [2020-12-02 11:58:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2020-12-02 11:58:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 8900 transitions. [2020-12-02 11:58:51,290 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 8900 transitions. Word has length 16 [2020-12-02 11:58:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:51,290 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 8900 transitions. [2020-12-02 11:58:51,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:58:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 8900 transitions. [2020-12-02 11:58:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:58:51,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:51,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:51,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:58:51,298 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash -600338635, now seen corresponding path program 3 times [2020-12-02 11:58:51,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:51,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818417297] [2020-12-02 11:58:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:51,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818417297] [2020-12-02 11:58:51,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:51,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:51,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912125794] [2020-12-02 11:58:51,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:58:51,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:58:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:51,540 INFO L87 Difference]: Start difference. First operand 2378 states and 8900 transitions. Second operand 6 states. [2020-12-02 11:58:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:51,716 INFO L93 Difference]: Finished difference Result 2602 states and 9508 transitions. [2020-12-02 11:58:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:51,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 11:58:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:51,730 INFO L225 Difference]: With dead ends: 2602 [2020-12-02 11:58:51,730 INFO L226 Difference]: Without dead ends: 2314 [2020-12-02 11:58:51,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2020-12-02 11:58:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1786. [2020-12-02 11:58:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-12-02 11:58:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6540 transitions. [2020-12-02 11:58:51,810 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6540 transitions. Word has length 16 [2020-12-02 11:58:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:51,811 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6540 transitions. [2020-12-02 11:58:51,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:58:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6540 transitions. [2020-12-02 11:58:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:58:51,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:51,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:51,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:58:51,815 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1267259155, now seen corresponding path program 1 times [2020-12-02 11:58:51,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:51,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226585485] [2020-12-02 11:58:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:51,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226585485] [2020-12-02 11:58:51,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:51,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:58:51,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62506061] [2020-12-02 11:58:51,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:51,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:51,905 INFO L87 Difference]: Start difference. First operand 1786 states and 6540 transitions. Second operand 4 states. [2020-12-02 11:58:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:51,969 INFO L93 Difference]: Finished difference Result 1876 states and 6260 transitions. [2020-12-02 11:58:51,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:51,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-02 11:58:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:51,976 INFO L225 Difference]: With dead ends: 1876 [2020-12-02 11:58:51,977 INFO L226 Difference]: Without dead ends: 1396 [2020-12-02 11:58:51,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-12-02 11:58:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2020-12-02 11:58:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2020-12-02 11:58:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 4608 transitions. [2020-12-02 11:58:52,024 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 4608 transitions. Word has length 16 [2020-12-02 11:58:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,025 INFO L481 AbstractCegarLoop]: Abstraction has 1396 states and 4608 transitions. [2020-12-02 11:58:52,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 4608 transitions. [2020-12-02 11:58:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 11:58:52,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 11:58:52,029 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 630278985, now seen corresponding path program 1 times [2020-12-02 11:58:52,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252194972] [2020-12-02 11:58:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:52,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252194972] [2020-12-02 11:58:52,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:52,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:52,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248810381] [2020-12-02 11:58:52,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:52,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:52,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:52,110 INFO L87 Difference]: Start difference. First operand 1396 states and 4608 transitions. Second operand 5 states. [2020-12-02 11:58:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:52,183 INFO L93 Difference]: Finished difference Result 1233 states and 3748 transitions. [2020-12-02 11:58:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:58:52,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-02 11:58:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:52,188 INFO L225 Difference]: With dead ends: 1233 [2020-12-02 11:58:52,188 INFO L226 Difference]: Without dead ends: 933 [2020-12-02 11:58:52,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2020-12-02 11:58:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2020-12-02 11:58:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-12-02 11:58:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2786 transitions. [2020-12-02 11:58:52,218 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2786 transitions. Word has length 17 [2020-12-02 11:58:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,218 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 2786 transitions. [2020-12-02 11:58:52,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2786 transitions. [2020-12-02 11:58:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:58:52,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 11:58:52,222 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870722, now seen corresponding path program 1 times [2020-12-02 11:58:52,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549805598] [2020-12-02 11:58:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:52,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549805598] [2020-12-02 11:58:52,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:52,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:52,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363335211] [2020-12-02 11:58:52,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:52,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:52,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:52,291 INFO L87 Difference]: Start difference. First operand 933 states and 2786 transitions. Second operand 3 states. [2020-12-02 11:58:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:52,315 INFO L93 Difference]: Finished difference Result 1325 states and 3849 transitions. [2020-12-02 11:58:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:52,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-02 11:58:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:52,320 INFO L225 Difference]: With dead ends: 1325 [2020-12-02 11:58:52,321 INFO L226 Difference]: Without dead ends: 943 [2020-12-02 11:58:52,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-12-02 11:58:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 927. [2020-12-02 11:58:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-12-02 11:58:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2617 transitions. [2020-12-02 11:58:52,354 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2617 transitions. Word has length 19 [2020-12-02 11:58:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,355 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 2617 transitions. [2020-12-02 11:58:52,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2617 transitions. [2020-12-02 11:58:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:58:52,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 11:58:52,359 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1211352883, now seen corresponding path program 1 times [2020-12-02 11:58:52,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415839233] [2020-12-02 11:58:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:52,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415839233] [2020-12-02 11:58:52,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:52,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:58:52,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355087562] [2020-12-02 11:58:52,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:52,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:52,440 INFO L87 Difference]: Start difference. First operand 927 states and 2617 transitions. Second operand 4 states. [2020-12-02 11:58:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:52,474 INFO L93 Difference]: Finished difference Result 1219 states and 3356 transitions. [2020-12-02 11:58:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:58:52,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-02 11:58:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:52,479 INFO L225 Difference]: With dead ends: 1219 [2020-12-02 11:58:52,479 INFO L226 Difference]: Without dead ends: 537 [2020-12-02 11:58:52,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-12-02 11:58:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-12-02 11:58:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-12-02 11:58:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1360 transitions. [2020-12-02 11:58:52,497 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1360 transitions. Word has length 20 [2020-12-02 11:58:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,497 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1360 transitions. [2020-12-02 11:58:52,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1360 transitions. [2020-12-02 11:58:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:58:52,499 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 11:58:52,500 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1643099372, now seen corresponding path program 1 times [2020-12-02 11:58:52,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429478267] [2020-12-02 11:58:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:52,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429478267] [2020-12-02 11:58:52,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:52,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:58:52,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994825236] [2020-12-02 11:58:52,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:58:52,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:58:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:52,625 INFO L87 Difference]: Start difference. First operand 537 states and 1360 transitions. Second operand 6 states. [2020-12-02 11:58:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:52,704 INFO L93 Difference]: Finished difference Result 458 states and 1112 transitions. [2020-12-02 11:58:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:58:52,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-02 11:58:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:52,707 INFO L225 Difference]: With dead ends: 458 [2020-12-02 11:58:52,708 INFO L226 Difference]: Without dead ends: 373 [2020-12-02 11:58:52,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-02 11:58:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-12-02 11:58:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-02 11:58:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 900 transitions. [2020-12-02 11:58:52,720 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 900 transitions. Word has length 20 [2020-12-02 11:58:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,720 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 900 transitions. [2020-12-02 11:58:52,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:58:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 900 transitions. [2020-12-02 11:58:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:58:52,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 11:58:52,722 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1148150892, now seen corresponding path program 1 times [2020-12-02 11:58:52,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879707161] [2020-12-02 11:58:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:52,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879707161] [2020-12-02 11:58:52,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:52,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 11:58:52,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220386767] [2020-12-02 11:58:52,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:58:52,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:58:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:52,851 INFO L87 Difference]: Start difference. First operand 373 states and 900 transitions. Second operand 7 states. [2020-12-02 11:58:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:52,946 INFO L93 Difference]: Finished difference Result 352 states and 858 transitions. [2020-12-02 11:58:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 11:58:52,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-02 11:58:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:52,948 INFO L225 Difference]: With dead ends: 352 [2020-12-02 11:58:52,948 INFO L226 Difference]: Without dead ends: 171 [2020-12-02 11:58:52,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-02 11:58:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-02 11:58:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-12-02 11:58:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-12-02 11:58:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 392 transitions. [2020-12-02 11:58:52,955 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 392 transitions. Word has length 23 [2020-12-02 11:58:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:52,955 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 392 transitions. [2020-12-02 11:58:52,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:58:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 392 transitions. [2020-12-02 11:58:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 11:58:52,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:52,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:52,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 11:58:52,957 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1406554058, now seen corresponding path program 1 times [2020-12-02 11:58:52,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:52,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632233219] [2020-12-02 11:58:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:53,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632233219] [2020-12-02 11:58:53,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:53,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:58:53,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179013079] [2020-12-02 11:58:53,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:58:53,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:58:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:58:53,121 INFO L87 Difference]: Start difference. First operand 171 states and 392 transitions. Second operand 7 states. [2020-12-02 11:58:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:53,240 INFO L93 Difference]: Finished difference Result 219 states and 497 transitions. [2020-12-02 11:58:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:58:53,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-12-02 11:58:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:53,242 INFO L225 Difference]: With dead ends: 219 [2020-12-02 11:58:53,242 INFO L226 Difference]: Without dead ends: 64 [2020-12-02 11:58:53,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:58:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-02 11:58:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-02 11:58:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-02 11:58:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-12-02 11:58:53,245 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-12-02 11:58:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:53,245 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-12-02 11:58:53,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:58:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-12-02 11:58:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 11:58:53,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:53,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:53,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 11:58:53,246 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -772400604, now seen corresponding path program 2 times [2020-12-02 11:58:53,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:53,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061154495] [2020-12-02 11:58:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:58:53,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:58:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:58:53,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:58:53,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:58:53,409 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:58:53,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 11:58:53,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:58:53 BasicIcfg [2020-12-02 11:58:53,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:58:53,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:58:53,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:58:53,603 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:58:53,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:20" (3/4) ... [2020-12-02 11:58:53,607 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:58:53,765 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:58:53,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:58:53,768 INFO L168 Benchmark]: Toolchain (without parser) took 36928.15 ms. Allocated memory was 46.1 MB in the beginning and 343.9 MB in the end (delta: 297.8 MB). Free memory was 21.4 MB in the beginning and 151.7 MB in the end (delta: -130.3 MB). Peak memory consumption was 169.4 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,769 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 46.1 MB. Free memory is still 30.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:58:53,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 991.19 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 21.2 MB in the beginning and 29.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.78 ms. Allocated memory is still 58.7 MB. Free memory was 29.8 MB in the beginning and 26.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,770 INFO L168 Benchmark]: Boogie Preprocessor took 49.83 ms. Allocated memory is still 58.7 MB. Free memory was 26.8 MB in the beginning and 38.6 MB in the end (delta: -11.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,770 INFO L168 Benchmark]: RCFGBuilder took 2256.19 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 38.6 MB in the beginning and 42.8 MB in the end (delta: -4.2 MB). Peak memory consumption was 32.7 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,771 INFO L168 Benchmark]: TraceAbstraction took 33327.41 ms. Allocated memory was 86.0 MB in the beginning and 343.9 MB in the end (delta: 257.9 MB). Free memory was 42.0 MB in the beginning and 169.5 MB in the end (delta: -127.5 MB). Peak memory consumption was 129.0 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,771 INFO L168 Benchmark]: Witness Printer took 163.65 ms. Allocated memory is still 343.9 MB. Free memory was 169.5 MB in the beginning and 151.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:53,774 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.26 ms. Allocated memory is still 46.1 MB. Free memory is still 30.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 991.19 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 21.2 MB in the beginning and 29.8 MB in the end (delta: -8.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.78 ms. Allocated memory is still 58.7 MB. Free memory was 29.8 MB in the beginning and 26.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.83 ms. Allocated memory is still 58.7 MB. Free memory was 26.8 MB in the beginning and 38.6 MB in the end (delta: -11.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2256.19 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 38.6 MB in the beginning and 42.8 MB in the end (delta: -4.2 MB). Peak memory consumption was 32.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33327.41 ms. Allocated memory was 86.0 MB in the beginning and 343.9 MB in the end (delta: 257.9 MB). Free memory was 42.0 MB in the beginning and 169.5 MB in the end (delta: -127.5 MB). Peak memory consumption was 129.0 MB. Max. memory is 16.1 GB. * Witness Printer took 163.65 ms. Allocated memory is still 343.9 MB. Free memory was 169.5 MB in the beginning and 151.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1770 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 214 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 26.0s, 128 PlacesBefore, 45 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 7778 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1245; [L847] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1246; [L849] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1247; [L851] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1248; [L853] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.3s, HoareTripleCheckerStatistics: 594 SDtfs, 580 SDslu, 1005 SDs, 0 SdLazy, 413 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1520 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 26917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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! Received shutdown request...