./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_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/mix051_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 3afffae8fa9714cf6d7a3a3960cf6aabbe91fb68 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:59:27,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:59:27,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:59:27,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:59:27,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:59:27,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:59:27,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:59:27,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:59:27,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:59:27,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:59:27,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:59:27,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:59:27,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:59:27,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:59:27,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:59:27,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:59:27,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:59:27,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:59:27,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:59:27,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:59:27,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:59:27,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:59:27,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:59:27,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:59:27,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:59:27,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:59:27,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:59:27,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:59:27,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:59:27,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:59:27,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:59:27,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:59:27,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:59:27,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:59:27,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:59:27,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:59:27,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:59:27,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:59:27,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:59:27,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:59:27,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:59:27,458 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:59:27,521 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:59:27,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:59:27,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:59:27,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:59:27,527 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:59:27,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:59:27,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:59:27,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:59:27,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:59:27,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:59:27,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:59:27,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:59:27,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:59:27,531 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:59:27,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:59:27,531 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:59:27,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:59:27,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:59:27,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:59:27,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:59:27,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:59:27,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:59:27,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:59:27,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:59:27,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:59:27,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:59:27,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:59:27,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:59:27,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:59:27,535 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 -> 3afffae8fa9714cf6d7a3a3960cf6aabbe91fb68 [2020-12-02 11:59:27,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:59:27,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:59:27,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:59:27,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:59:27,975 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:59:27,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i [2020-12-02 11:59:28,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efc10ed5/20b576696c06477bab944950f03548a3/FLAG184486bdb [2020-12-02 11:59:28,780 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:59:28,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i [2020-12-02 11:59:28,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efc10ed5/20b576696c06477bab944950f03548a3/FLAG184486bdb [2020-12-02 11:59:29,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efc10ed5/20b576696c06477bab944950f03548a3 [2020-12-02 11:59:29,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:59:29,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:59:29,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:59:29,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:59:29,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:59:29,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31416be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29, skipping insertion in model container [2020-12-02 11:59:29,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:59:29,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:59:29,330 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/mix051_tso.opt.i[948,961] [2020-12-02 11:59:29,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:59:29,543 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:59:29,558 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/mix051_tso.opt.i[948,961] [2020-12-02 11:59:29,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:59:29,710 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:59:29,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29 WrapperNode [2020-12-02 11:59:29,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:59:29,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:59:29,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:59:29,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:59:29,725 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:59:29" (1/1) ... [2020-12-02 11:59:29,777 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:59:29" (1/1) ... [2020-12-02 11:59:29,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:59:29,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:59:29,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:59:29,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:59:29,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (1/1) ... [2020-12-02 11:59:29,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:59:29,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:59:29,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:59:29,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:59:29,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (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:59:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:59:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:59:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:59:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:59:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:59:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:59:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:59:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:59:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 11:59:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 11:59:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-02 11:59:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-02 11:59:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:59:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:59:30,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:59:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:59:30,009 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:59:31,961 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:59:31,962 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:59:31,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:31 BoogieIcfgContainer [2020-12-02 11:59:31,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:59:31,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:59:31,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:59:31,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:59:31,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:59:29" (1/3) ... [2020-12-02 11:59:31,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76988597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:31, skipping insertion in model container [2020-12-02 11:59:31,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:59:29" (2/3) ... [2020-12-02 11:59:31,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76988597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:59:31, skipping insertion in model container [2020-12-02 11:59:31,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:31" (3/3) ... [2020-12-02 11:59:31,976 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.opt.i [2020-12-02 11:59:31,994 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:59:31,994 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:59:31,999 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:59:32,001 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:59:32,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,043 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,043 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,048 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,050 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,050 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,051 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,051 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,093 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,093 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,094 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,094 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,095 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,095 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,096 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,096 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,112 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,121 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,122 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:59:32,124 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:59:32,141 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-02 11:59:32,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:59:32,179 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:59:32,180 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:59:32,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:59:32,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:59:32,180 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:59:32,180 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:59:32,180 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:59:32,201 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:59:32,204 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-02 11:59:32,208 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-02 11:59:32,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-12-02 11:59:32,291 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-12-02 11:59:32,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:59:32,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-12-02 11:59:32,303 INFO L116 LiptonReduction]: Number of co-enabled transitions 2300 [2020-12-02 11:59:32,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:32,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:32,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:32,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:32,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:32,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:32,967 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:59:32,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,071 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:59:33,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,259 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:59:33,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:33,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:33,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,313 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:59:33,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:33,669 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 11:59:33,789 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 11:59:34,417 WARN L197 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-02 11:59:34,653 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-02 11:59:34,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:34,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:59:34,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:34,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:34,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:34,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:34,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:34,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:34,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:59:34,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:34,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:34,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:34,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:34,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:34,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:34,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:34,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:34,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:35,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:59:35,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:35,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:35,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:35,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:35,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:35,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:59:35,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:35,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:35,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:35,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:35,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:35,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:35,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:35,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:35,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:35,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:35,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:59:35,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:35,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:35,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-02 11:59:35,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:59:36,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:36,782 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:59:36,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:36,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:36,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:36,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:36,809 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:59:36,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:37,096 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 11:59:37,208 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-02 11:59:37,737 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2020-12-02 11:59:38,010 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-12-02 11:59:38,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:38,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:38,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:59:38,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 11:59:38,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-02 11:59:38,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 11:59:38,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:59:38,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:38,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:38,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:59:38,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:59:38,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:38,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:59:38,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:39,139 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-02 11:59:39,309 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-02 11:59:39,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:39,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:39,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:39,589 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:59:39,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:39,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:39,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:39,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:39,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:39,613 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:59:39,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:40,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:40,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:40,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:40,237 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:59:40,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:59:40,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:40,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:59:40,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:59:40,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:40,263 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:59:40,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:59:41,650 WARN L197 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-02 11:59:41,903 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-02 11:59:42,431 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-02 11:59:42,677 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-02 11:59:42,685 INFO L131 LiptonReduction]: Checked pairs total: 5480 [2020-12-02 11:59:42,685 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-12-02 11:59:42,693 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-12-02 11:59:42,863 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-12-02 11:59:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-12-02 11:59:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:59:42,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:42,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:59:42,876 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:59:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash 333670476, now seen corresponding path program 1 times [2020-12-02 11:59:42,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:42,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556520610] [2020-12-02 11:59:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:43,271 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:59:43,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556520610] [2020-12-02 11:59:43,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:43,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:59:43,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683367329] [2020-12-02 11:59:43,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:59:43,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:59:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:59:43,298 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-12-02 11:59:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:43,405 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-12-02 11:59:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:59:43,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 11:59:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:43,458 INFO L225 Difference]: With dead ends: 1770 [2020-12-02 11:59:43,458 INFO L226 Difference]: Without dead ends: 1450 [2020-12-02 11:59:43,460 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:59:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-12-02 11:59:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-12-02 11:59:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-12-02 11:59:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-12-02 11:59:43,629 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-12-02 11:59:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:43,630 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-12-02 11:59:43,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:59:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-12-02 11:59:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 11:59:43,636 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:43,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:59:43,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:59:43,637 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:59:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:43,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1465222219, now seen corresponding path program 1 times [2020-12-02 11:59:43,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:43,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989245804] [2020-12-02 11:59:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:43,797 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:59:43,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989245804] [2020-12-02 11:59:43,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:43,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:59:43,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29536347] [2020-12-02 11:59:43,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:59:43,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:59:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:59:43,802 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-12-02 11:59:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:43,830 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-12-02 11:59:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:59:43,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-02 11:59:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:43,845 INFO L225 Difference]: With dead ends: 1410 [2020-12-02 11:59:43,845 INFO L226 Difference]: Without dead ends: 1410 [2020-12-02 11:59:43,846 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:59:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-12-02 11:59:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-12-02 11:59:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-12-02 11:59:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-12-02 11:59:43,939 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-12-02 11:59:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:43,940 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-12-02 11:59:43,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:59:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-12-02 11:59:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 11:59:43,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:43,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:59:43,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:59:43,949 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:59:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1290388431, now seen corresponding path program 1 times [2020-12-02 11:59:43,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:43,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302266551] [2020-12-02 11:59:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:44,110 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:59:44,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302266551] [2020-12-02 11:59:44,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:44,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:59:44,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794841045] [2020-12-02 11:59:44,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:59:44,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:59:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:59:44,113 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 4 states. [2020-12-02 11:59:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:44,169 INFO L93 Difference]: Finished difference Result 1430 states and 4778 transitions. [2020-12-02 11:59:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:59:44,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 11:59:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:44,180 INFO L225 Difference]: With dead ends: 1430 [2020-12-02 11:59:44,180 INFO L226 Difference]: Without dead ends: 1110 [2020-12-02 11:59:44,181 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:59:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2020-12-02 11:59:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2020-12-02 11:59:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-12-02 11:59:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3694 transitions. [2020-12-02 11:59:44,225 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3694 transitions. Word has length 12 [2020-12-02 11:59:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:44,225 INFO L481 AbstractCegarLoop]: Abstraction has 1110 states and 3694 transitions. [2020-12-02 11:59:44,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:59:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3694 transitions. [2020-12-02 11:59:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 11:59:44,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:44,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:59:44,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:59:44,228 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:59:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1915843933, now seen corresponding path program 1 times [2020-12-02 11:59:44,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:44,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568689945] [2020-12-02 11:59:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:44,347 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:59:44,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568689945] [2020-12-02 11:59:44,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:44,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:59:44,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878501648] [2020-12-02 11:59:44,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:59:44,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:59:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:59:44,353 INFO L87 Difference]: Start difference. First operand 1110 states and 3694 transitions. Second operand 3 states. [2020-12-02 11:59:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:44,398 INFO L93 Difference]: Finished difference Result 1638 states and 5270 transitions. [2020-12-02 11:59:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:59:44,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-12-02 11:59:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:44,413 INFO L225 Difference]: With dead ends: 1638 [2020-12-02 11:59:44,413 INFO L226 Difference]: Without dead ends: 1570 [2020-12-02 11:59:44,414 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:59:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2020-12-02 11:59:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1498. [2020-12-02 11:59:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2020-12-02 11:59:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 4896 transitions. [2020-12-02 11:59:44,478 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 4896 transitions. Word has length 14 [2020-12-02 11:59:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:44,479 INFO L481 AbstractCegarLoop]: Abstraction has 1498 states and 4896 transitions. [2020-12-02 11:59:44,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:59:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 4896 transitions. [2020-12-02 11:59:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 11:59:44,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:44,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:59:44,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:59:44,482 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:59:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1359649850, now seen corresponding path program 1 times [2020-12-02 11:59:44,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:44,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253034211] [2020-12-02 11:59:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:44,548 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:59:44,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253034211] [2020-12-02 11:59:44,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:44,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:59:44,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623451967] [2020-12-02 11:59:44,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:59:44,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:59:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:59:44,551 INFO L87 Difference]: Start difference. First operand 1498 states and 4896 transitions. Second operand 5 states. [2020-12-02 11:59:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:44,640 INFO L93 Difference]: Finished difference Result 1305 states and 3869 transitions. [2020-12-02 11:59:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:59:44,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-02 11:59:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:44,649 INFO L225 Difference]: With dead ends: 1305 [2020-12-02 11:59:44,649 INFO L226 Difference]: Without dead ends: 995 [2020-12-02 11:59:44,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:59:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-12-02 11:59:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 975. [2020-12-02 11:59:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2020-12-02 11:59:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2828 transitions. [2020-12-02 11:59:44,692 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 2828 transitions. Word has length 14 [2020-12-02 11:59:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:44,693 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 2828 transitions. [2020-12-02 11:59:44,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:59:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2828 transitions. [2020-12-02 11:59:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 11:59:44,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:44,695 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:59:44,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:59:44,696 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:59:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1128358290, now seen corresponding path program 1 times [2020-12-02 11:59:44,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:44,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941959021] [2020-12-02 11:59:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:44,838 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:59:44,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941959021] [2020-12-02 11:59:44,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:44,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 11:59:44,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052646132] [2020-12-02 11:59:44,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 11:59:44,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:44,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 11:59:44,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:59:44,841 INFO L87 Difference]: Start difference. First operand 975 states and 2828 transitions. Second operand 6 states. [2020-12-02 11:59:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:44,927 INFO L93 Difference]: Finished difference Result 837 states and 2376 transitions. [2020-12-02 11:59:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:59:44,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 11:59:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:44,934 INFO L225 Difference]: With dead ends: 837 [2020-12-02 11:59:44,935 INFO L226 Difference]: Without dead ends: 720 [2020-12-02 11:59:44,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-02 11:59:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-02 11:59:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 624. [2020-12-02 11:59:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2020-12-02 11:59:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1787 transitions. [2020-12-02 11:59:44,962 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1787 transitions. Word has length 17 [2020-12-02 11:59:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:44,963 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 1787 transitions. [2020-12-02 11:59:44,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 11:59:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1787 transitions. [2020-12-02 11:59:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 11:59:44,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:44,966 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:59:44,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:59:44,967 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:59:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1282915133, now seen corresponding path program 1 times [2020-12-02 11:59:44,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:44,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528876286] [2020-12-02 11:59:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:45,099 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:59:45,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528876286] [2020-12-02 11:59:45,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:45,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 11:59:45,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136001293] [2020-12-02 11:59:45,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 11:59:45,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 11:59:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:59:45,104 INFO L87 Difference]: Start difference. First operand 624 states and 1787 transitions. Second operand 7 states. [2020-12-02 11:59:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:45,197 INFO L93 Difference]: Finished difference Result 593 states and 1724 transitions. [2020-12-02 11:59:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:59:45,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-02 11:59:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:45,202 INFO L225 Difference]: With dead ends: 593 [2020-12-02 11:59:45,203 INFO L226 Difference]: Without dead ends: 549 [2020-12-02 11:59:45,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-12-02 11:59:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-12-02 11:59:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 469. [2020-12-02 11:59:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2020-12-02 11:59:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1395 transitions. [2020-12-02 11:59:45,221 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1395 transitions. Word has length 20 [2020-12-02 11:59:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:45,222 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 1395 transitions. [2020-12-02 11:59:45,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 11:59:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1395 transitions. [2020-12-02 11:59:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:45,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:45,224 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] [2020-12-02 11:59:45,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:59:45,225 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:59:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -996640531, now seen corresponding path program 1 times [2020-12-02 11:59:45,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:45,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589503319] [2020-12-02 11:59:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:45,316 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:59:45,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589503319] [2020-12-02 11:59:45,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:45,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:59:45,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712489207] [2020-12-02 11:59:45,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:59:45,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:59:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:59:45,319 INFO L87 Difference]: Start difference. First operand 469 states and 1395 transitions. Second operand 4 states. [2020-12-02 11:59:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:45,370 INFO L93 Difference]: Finished difference Result 715 states and 2077 transitions. [2020-12-02 11:59:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:59:45,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-02 11:59:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:45,376 INFO L225 Difference]: With dead ends: 715 [2020-12-02 11:59:45,376 INFO L226 Difference]: Without dead ends: 593 [2020-12-02 11:59:45,380 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:59:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-02 11:59:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 405. [2020-12-02 11:59:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-12-02 11:59:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1163 transitions. [2020-12-02 11:59:45,397 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1163 transitions. Word has length 24 [2020-12-02 11:59:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:45,397 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1163 transitions. [2020-12-02 11:59:45,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:59:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1163 transitions. [2020-12-02 11:59:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:45,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:45,400 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] [2020-12-02 11:59:45,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:59:45,400 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:59:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash 845248617, now seen corresponding path program 2 times [2020-12-02 11:59:45,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:45,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692838777] [2020-12-02 11:59:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:45,532 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:59:45,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692838777] [2020-12-02 11:59:45,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:45,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:59:45,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448222491] [2020-12-02 11:59:45,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:59:45,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:59:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:59:45,535 INFO L87 Difference]: Start difference. First operand 405 states and 1163 transitions. Second operand 5 states. [2020-12-02 11:59:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:45,590 INFO L93 Difference]: Finished difference Result 691 states and 1937 transitions. [2020-12-02 11:59:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:59:45,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-02 11:59:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:45,595 INFO L225 Difference]: With dead ends: 691 [2020-12-02 11:59:45,595 INFO L226 Difference]: Without dead ends: 291 [2020-12-02 11:59:45,596 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:59:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-02 11:59:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 231. [2020-12-02 11:59:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-12-02 11:59:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 605 transitions. [2020-12-02 11:59:45,606 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 605 transitions. Word has length 24 [2020-12-02 11:59:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:45,606 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 605 transitions. [2020-12-02 11:59:45,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:59:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 605 transitions. [2020-12-02 11:59:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:45,608 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:45,608 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] [2020-12-02 11:59:45,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:59:45,608 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:59:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 936047199, now seen corresponding path program 3 times [2020-12-02 11:59:45,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:45,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188259260] [2020-12-02 11:59:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:45,731 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:59:45,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188259260] [2020-12-02 11:59:45,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:45,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:59:45,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043717150] [2020-12-02 11:59:45,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:59:45,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:59:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:59:45,734 INFO L87 Difference]: Start difference. First operand 231 states and 605 transitions. Second operand 4 states. [2020-12-02 11:59:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:45,757 INFO L93 Difference]: Finished difference Result 305 states and 793 transitions. [2020-12-02 11:59:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:59:45,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-02 11:59:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:45,760 INFO L225 Difference]: With dead ends: 305 [2020-12-02 11:59:45,760 INFO L226 Difference]: Without dead ends: 145 [2020-12-02 11:59:45,761 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:59:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-02 11:59:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-12-02 11:59:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-02 11:59:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 351 transitions. [2020-12-02 11:59:45,766 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 351 transitions. Word has length 24 [2020-12-02 11:59:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:45,767 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 351 transitions. [2020-12-02 11:59:45,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:59:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 351 transitions. [2020-12-02 11:59:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:45,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:45,768 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] [2020-12-02 11:59:45,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:59:45,769 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:59:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1482739699, now seen corresponding path program 4 times [2020-12-02 11:59:45,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:45,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756120210] [2020-12-02 11:59:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:45,874 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:59:45,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756120210] [2020-12-02 11:59:45,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:45,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:59:45,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695479761] [2020-12-02 11:59:45,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:59:45,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:59:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:59:45,878 INFO L87 Difference]: Start difference. First operand 145 states and 351 transitions. Second operand 4 states. [2020-12-02 11:59:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:45,923 INFO L93 Difference]: Finished difference Result 195 states and 469 transitions. [2020-12-02 11:59:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:59:45,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-02 11:59:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:45,924 INFO L225 Difference]: With dead ends: 195 [2020-12-02 11:59:45,925 INFO L226 Difference]: Without dead ends: 113 [2020-12-02 11:59:45,925 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:59:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-02 11:59:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2020-12-02 11:59:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-02 11:59:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 227 transitions. [2020-12-02 11:59:45,929 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 227 transitions. Word has length 24 [2020-12-02 11:59:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:45,930 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 227 transitions. [2020-12-02 11:59:45,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:59:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 227 transitions. [2020-12-02 11:59:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:45,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:45,932 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] [2020-12-02 11:59:45,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 11:59:45,933 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:59:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash 204395569, now seen corresponding path program 5 times [2020-12-02 11:59:45,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:45,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060839783] [2020-12-02 11:59:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:46,040 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:59:46,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060839783] [2020-12-02 11:59:46,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:46,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:59:46,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088073005] [2020-12-02 11:59:46,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:59:46,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:59:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:59:46,043 INFO L87 Difference]: Start difference. First operand 101 states and 227 transitions. Second operand 5 states. [2020-12-02 11:59:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:46,080 INFO L93 Difference]: Finished difference Result 139 states and 313 transitions. [2020-12-02 11:59:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:59:46,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-02 11:59:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:46,082 INFO L225 Difference]: With dead ends: 139 [2020-12-02 11:59:46,082 INFO L226 Difference]: Without dead ends: 79 [2020-12-02 11:59:46,083 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:59:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-02 11:59:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-02 11:59:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-02 11:59:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-12-02 11:59:46,086 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-12-02 11:59:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:46,086 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-12-02 11:59:46,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:59:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-12-02 11:59:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:46,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:46,089 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] [2020-12-02 11:59:46,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 11:59:46,089 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:59:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash -191364127, now seen corresponding path program 6 times [2020-12-02 11:59:46,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:46,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706294394] [2020-12-02 11:59:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:59:46,253 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:59:46,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706294394] [2020-12-02 11:59:46,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:59:46,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:59:46,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937751042] [2020-12-02 11:59:46,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:59:46,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:59:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:59:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:59:46,257 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 5 states. [2020-12-02 11:59:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:59:46,356 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-12-02 11:59:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 11:59:46,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-02 11:59:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:59:46,358 INFO L225 Difference]: With dead ends: 97 [2020-12-02 11:59:46,358 INFO L226 Difference]: Without dead ends: 51 [2020-12-02 11:59:46,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 11:59:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-02 11:59:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-02 11:59:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-02 11:59:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-12-02 11:59:46,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-12-02 11:59:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:59:46,361 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-12-02 11:59:46,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:59:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-12-02 11:59:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 11:59:46,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:59:46,363 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] [2020-12-02 11:59:46,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 11:59:46,364 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:59:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:59:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash 166698551, now seen corresponding path program 7 times [2020-12-02 11:59:46,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:59:46,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832771600] [2020-12-02 11:59:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:59:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:59:46,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:59:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:59:46,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:59:46,567 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:59:46,567 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:59:46,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 11:59:46,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:59:46 BasicIcfg [2020-12-02 11:59:46,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:59:46,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:59:46,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:59:46,749 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:59:46,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:59:31" (3/4) ... [2020-12-02 11:59:46,752 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:59:46,869 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:59:46,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:59:46,871 INFO L168 Benchmark]: Toolchain (without parser) took 17855.26 ms. Allocated memory was 48.2 MB in the beginning and 285.2 MB in the end (delta: 237.0 MB). Free memory was 24.0 MB in the beginning and 129.1 MB in the end (delta: -105.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,871 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 48.2 MB. Free memory is still 31.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:59:46,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.17 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 36.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.81 ms. Allocated memory is still 58.7 MB. Free memory was 36.9 MB in the beginning and 34.5 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:59:46,873 INFO L168 Benchmark]: Boogie Preprocessor took 71.47 ms. Allocated memory is still 58.7 MB. Free memory was 34.4 MB in the beginning and 32.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,874 INFO L168 Benchmark]: RCFGBuilder took 2051.66 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 32.3 MB in the beginning and 46.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,874 INFO L168 Benchmark]: TraceAbstraction took 14781.35 ms. Allocated memory was 86.0 MB in the beginning and 285.2 MB in the end (delta: 199.2 MB). Free memory was 45.5 MB in the beginning and 149.0 MB in the end (delta: -103.5 MB). Peak memory consumption was 95.8 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,875 INFO L168 Benchmark]: Witness Printer took 120.73 ms. Allocated memory is still 285.2 MB. Free memory was 149.0 MB in the beginning and 129.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-02 11:59:46,878 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.23 ms. Allocated memory is still 48.2 MB. Free memory is still 31.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 695.17 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 36.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.81 ms. Allocated memory is still 58.7 MB. Free memory was 36.9 MB in the beginning and 34.5 MB in the end (delta: 2.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.47 ms. Allocated memory is still 58.7 MB. Free memory was 34.4 MB in the beginning and 32.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2051.66 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 32.3 MB in the beginning and 46.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14781.35 ms. Allocated memory was 86.0 MB in the beginning and 285.2 MB in the end (delta: 199.2 MB). Free memory was 45.5 MB in the beginning and 149.0 MB in the end (delta: -103.5 MB). Peak memory consumption was 95.8 MB. Max. memory is 16.1 GB. * Witness Printer took 120.73 ms. Allocated memory is still 285.2 MB. Free memory was 149.0 MB in the beginning and 129.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1546 VarBasedMoverChecksPositive, 76 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 183 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 124 PlacesBefore, 43 PlacesAfterwards, 113 TransitionsBefore, 30 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5480 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1381; [L847] FCALL, FORK 0 pthread_create(&t1381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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 t1382; [L849] FCALL, FORK 0 pthread_create(&t1382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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 t1383; [L851] FCALL, FORK 0 pthread_create(&t1383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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 t1384; [L853] FCALL, FORK 0 pthread_create(&t1384, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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=1, 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 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 388 SDtfs, 508 SDslu, 523 SDs, 0 SdLazy, 176 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred 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: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 528 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 25308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...