./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer --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 a167863e3e2460a2571e380ff1888ad7871fc4b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-a4ecdab [2020-11-28 02:59:24,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:59:24,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:59:24,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:59:24,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:59:24,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:59:24,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:59:24,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:59:24,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:59:24,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:59:24,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:59:24,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:59:24,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:59:24,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:59:24,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:59:24,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:59:24,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:59:24,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:59:24,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:59:24,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:59:24,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:59:24,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:59:24,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:59:24,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:59:24,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:59:24,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:59:24,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:59:24,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:59:24,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:59:24,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:59:24,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:59:24,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:59:24,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:59:24,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:59:24,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:59:24,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:59:24,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:59:24,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:59:24,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:59:24,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:59:24,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:59:24,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:59:24,770 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:59:24,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:59:24,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:59:24,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:59:24,779 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:59:24,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:59:24,779 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:59:24,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:59:24,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:59:24,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:59:24,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:59:24,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:59:24,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:59:24,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:59:24,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:59:24,782 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:59:24,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:59:24,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:59:24,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:59:24,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:59:24,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:59:24,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:59:24,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:59:24,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:59:24,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:59:24,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:59:24,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:59:24,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:59:24,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:59:24,785 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:/tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer 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 -> a167863e3e2460a2571e380ff1888ad7871fc4b5 [2020-11-28 02:59:25,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:59:25,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:59:25,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:59:25,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:59:25,047 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:59:25,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2020-11-28 02:59:25,116 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/data/a8ad63f3a/4c88749f79f74f2aa7b956a9d58a1a88/FLAGb679441f2 [2020-11-28 02:59:25,579 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:59:25,580 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2020-11-28 02:59:25,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/data/a8ad63f3a/4c88749f79f74f2aa7b956a9d58a1a88/FLAGb679441f2 [2020-11-28 02:59:25,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/data/a8ad63f3a/4c88749f79f74f2aa7b956a9d58a1a88 [2020-11-28 02:59:25,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:59:25,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:59:25,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:59:25,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:59:25,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:59:25,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:25" (1/1) ... [2020-11-28 02:59:25,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61665aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:25, skipping insertion in model container [2020-11-28 02:59:25,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:25" (1/1) ... [2020-11-28 02:59:25,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:59:25,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:59:26,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:59:26,433 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:59:26,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:59:26,580 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:59:26,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26 WrapperNode [2020-11-28 02:59:26,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:59:26,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:59:26,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:59:26,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:59:26,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:59:26,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:59:26,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:59:26,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:59:26,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... [2020-11-28 02:59:26,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:59:26,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:59:26,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:59:26,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:59:26,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/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-11-28 02:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:59:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:59:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:59:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:59:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:59:26,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:59:26,762 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 02:59:28,840 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:59:28,841 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:59:28,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:28 BoogieIcfgContainer [2020-11-28 02:59:28,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:59:28,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:59:28,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:59:28,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:59:28,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:59:25" (1/3) ... [2020-11-28 02:59:28,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb89e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:59:28, skipping insertion in model container [2020-11-28 02:59:28,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:26" (2/3) ... [2020-11-28 02:59:28,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb89e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:59:28, skipping insertion in model container [2020-11-28 02:59:28,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:28" (3/3) ... [2020-11-28 02:59:28,851 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.opt.i [2020-11-28 02:59:28,862 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:59:28,862 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:59:28,868 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:59:28,869 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:59:28,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,934 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,934 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,935 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:59:28,977 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:59:28,989 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 02:59:29,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:59:29,009 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:59:29,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:59:29,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:59:29,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:59:29,010 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:59:29,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:59:29,010 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:59:29,022 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:59:29,024 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-28 02:59:29,027 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-28 02:59:29,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 231 flow [2020-11-28 02:59:29,075 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-11-28 02:59:29,075 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:59:29,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-11-28 02:59:29,083 INFO L116 LiptonReduction]: Number of co-enabled transitions 2024 [2020-11-28 02:59:29,403 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-28 02:59:29,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:59:29,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:29,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:29,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:29,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:29,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:29,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:29,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:29,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:29,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:29,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:29,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:29,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:30,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:30,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:30,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:30,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:30,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:30,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:30,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:30,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:30,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:30,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:30,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:30,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:30,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:30,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:30,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:30,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:30,560 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 02:59:30,672 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 02:59:31,147 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:59:31,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:31,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:31,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:31,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:31,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:31,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:31,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:31,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:31,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:31,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:31,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:59:31,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:31,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:31,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:59:31,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:59:32,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:59:32,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:32,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:32,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:32,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:32,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:32,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:32,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:32,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:32,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:59:33,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:33,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:59:33,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:59:33,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:33,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:33,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:59:33,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:59:33,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:59:33,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:33,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:59:33,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:59:33,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:59:33,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:33,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:59:33,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:59:33,694 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 02:59:33,818 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 02:59:34,110 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2020-11-28 02:59:34,752 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 02:59:35,008 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 02:59:35,131 INFO L131 LiptonReduction]: Checked pairs total: 4880 [2020-11-28 02:59:35,131 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-28 02:59:35,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-28 02:59:35,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-11-28 02:59:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-11-28 02:59:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 02:59:35,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:35,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:35,210 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1080882322, now seen corresponding path program 1 times [2020-11-28 02:59:35,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:35,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013847747] [2020-11-28 02:59:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:35,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013847747] [2020-11-28 02:59:35,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:35,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:59:35,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315235743] [2020-11-28 02:59:35,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:59:35,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:59:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:59:35,494 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-11-28 02:59:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:35,617 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-11-28 02:59:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:59:35,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 02:59:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:35,658 INFO L225 Difference]: With dead ends: 650 [2020-11-28 02:59:35,658 INFO L226 Difference]: Without dead ends: 530 [2020-11-28 02:59:35,660 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-11-28 02:59:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-28 02:59:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-11-28 02:59:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-28 02:59:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-11-28 02:59:35,802 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-11-28 02:59:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:35,803 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-11-28 02:59:35,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:59:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-11-28 02:59:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 02:59:35,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:35,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:35,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:59:35,806 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash -654110915, now seen corresponding path program 1 times [2020-11-28 02:59:35,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:35,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791414798] [2020-11-28 02:59:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:35,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791414798] [2020-11-28 02:59:35,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:35,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:59:35,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150807654] [2020-11-28 02:59:35,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:59:35,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:59:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:59:35,936 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-11-28 02:59:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:35,949 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-11-28 02:59:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:59:35,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 02:59:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:35,955 INFO L225 Difference]: With dead ends: 482 [2020-11-28 02:59:35,955 INFO L226 Difference]: Without dead ends: 482 [2020-11-28 02:59:35,961 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-11-28 02:59:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-28 02:59:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-11-28 02:59:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-28 02:59:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-11-28 02:59:35,993 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 9 [2020-11-28 02:59:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:35,993 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-11-28 02:59:35,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:59:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-11-28 02:59:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 02:59:35,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:35,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:35,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:59:35,998 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:35,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash 323102118, now seen corresponding path program 1 times [2020-11-28 02:59:35,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:35,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121445701] [2020-11-28 02:59:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121445701] [2020-11-28 02:59:36,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:59:36,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59143581] [2020-11-28 02:59:36,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:59:36,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:59:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:59:36,091 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-11-28 02:59:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,104 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-11-28 02:59:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:59:36,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 02:59:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,109 INFO L225 Difference]: With dead ends: 458 [2020-11-28 02:59:36,109 INFO L226 Difference]: Without dead ends: 458 [2020-11-28 02:59:36,110 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-11-28 02:59:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-11-28 02:59:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-11-28 02:59:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-28 02:59:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-11-28 02:59:36,130 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-11-28 02:59:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,130 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-11-28 02:59:36,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:59:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-11-28 02:59:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 02:59:36,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:36,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:59:36,138 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1229959684, now seen corresponding path program 1 times [2020-11-28 02:59:36,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310833502] [2020-11-28 02:59:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310833502] [2020-11-28 02:59:36,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:59:36,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240458861] [2020-11-28 02:59:36,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:59:36,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:59:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:59:36,234 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-11-28 02:59:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,300 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-11-28 02:59:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:59:36,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 02:59:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,304 INFO L225 Difference]: With dead ends: 440 [2020-11-28 02:59:36,304 INFO L226 Difference]: Without dead ends: 320 [2020-11-28 02:59:36,304 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-11-28 02:59:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-11-28 02:59:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-11-28 02:59:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-11-28 02:59:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-11-28 02:59:36,315 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-11-28 02:59:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,316 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-11-28 02:59:36,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:59:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-11-28 02:59:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 02:59:36,317 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:36,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:59:36,317 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,318 INFO L82 PathProgramCache]: Analyzing trace with hash -925135082, now seen corresponding path program 1 times [2020-11-28 02:59:36,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795013977] [2020-11-28 02:59:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795013977] [2020-11-28 02:59:36,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:59:36,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945046663] [2020-11-28 02:59:36,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:59:36,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:59:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:59:36,463 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 5 states. [2020-11-28 02:59:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,521 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-11-28 02:59:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:59:36,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-28 02:59:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,523 INFO L225 Difference]: With dead ends: 265 [2020-11-28 02:59:36,524 INFO L226 Difference]: Without dead ends: 205 [2020-11-28 02:59:36,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:59:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-11-28 02:59:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-11-28 02:59:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-11-28 02:59:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-11-28 02:59:36,531 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-11-28 02:59:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,532 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-11-28 02:59:36,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:59:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-11-28 02:59:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 02:59:36,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:59:36,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:59:36,534 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1507823083, now seen corresponding path program 1 times [2020-11-28 02:59:36,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256871232] [2020-11-28 02:59:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256871232] [2020-11-28 02:59:36,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:59:36,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21788041] [2020-11-28 02:59:36,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:59:36,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:59:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:59:36,641 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 6 states. [2020-11-28 02:59:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,724 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-11-28 02:59:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:59:36,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 02:59:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,726 INFO L225 Difference]: With dead ends: 186 [2020-11-28 02:59:36,726 INFO L226 Difference]: Without dead ends: 173 [2020-11-28 02:59:36,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:59:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-28 02:59:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-28 02:59:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-28 02:59:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-11-28 02:59:36,733 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-11-28 02:59:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,733 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-11-28 02:59:36,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:59:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-11-28 02:59:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:59:36,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,734 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] [2020-11-28 02:59:36,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:59:36,735 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1217699242, now seen corresponding path program 1 times [2020-11-28 02:59:36,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806062540] [2020-11-28 02:59:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806062540] [2020-11-28 02:59:36,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:59:36,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222264382] [2020-11-28 02:59:36,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:59:36,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:59:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:59:36,820 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-11-28 02:59:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,840 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-11-28 02:59:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:59:36,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-28 02:59:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,842 INFO L225 Difference]: With dead ends: 220 [2020-11-28 02:59:36,842 INFO L226 Difference]: Without dead ends: 92 [2020-11-28 02:59:36,842 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-11-28 02:59:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-28 02:59:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-28 02:59:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-28 02:59:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-11-28 02:59:36,845 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-11-28 02:59:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,846 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-11-28 02:59:36,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:59:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-11-28 02:59:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:59:36,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,846 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] [2020-11-28 02:59:36,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:59:36,847 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1461062086, now seen corresponding path program 2 times [2020-11-28 02:59:36,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684828283] [2020-11-28 02:59:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:36,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684828283] [2020-11-28 02:59:36,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:36,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:59:36,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472995908] [2020-11-28 02:59:36,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:59:36,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:36,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:59:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:59:36,933 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 3 states. [2020-11-28 02:59:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:36,941 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-11-28 02:59:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:59:36,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-28 02:59:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:36,942 INFO L225 Difference]: With dead ends: 118 [2020-11-28 02:59:36,942 INFO L226 Difference]: Without dead ends: 48 [2020-11-28 02:59:36,942 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-11-28 02:59:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-28 02:59:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-28 02:59:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-28 02:59:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-11-28 02:59:36,945 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-11-28 02:59:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:36,945 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-11-28 02:59:36,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:59:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-11-28 02:59:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:59:36,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:36,946 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] [2020-11-28 02:59:36,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:59:36,946 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -267942436, now seen corresponding path program 3 times [2020-11-28 02:59:36,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:36,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670222987] [2020-11-28 02:59:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:59:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:59:37,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670222987] [2020-11-28 02:59:37,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:59:37,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:59:37,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974133194] [2020-11-28 02:59:37,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:59:37,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:59:37,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:59:37,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:59:37,087 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 5 states. [2020-11-28 02:59:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:59:37,153 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-11-28 02:59:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:59:37,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-28 02:59:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:59:37,154 INFO L225 Difference]: With dead ends: 58 [2020-11-28 02:59:37,154 INFO L226 Difference]: Without dead ends: 32 [2020-11-28 02:59:37,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:59:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-28 02:59:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-28 02:59:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-28 02:59:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-11-28 02:59:37,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-11-28 02:59:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:59:37,157 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-28 02:59:37,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:59:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-11-28 02:59:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:59:37,157 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:59:37,157 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] [2020-11-28 02:59:37,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:59:37,158 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:59:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:59:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 167132730, now seen corresponding path program 4 times [2020-11-28 02:59:37,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:59:37,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139137470] [2020-11-28 02:59:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:59:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:37,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:59:37,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:59:37,280 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:59:37,280 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:59:37,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:59:37,281 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 02:59:37,297 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L852-->L859: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In1001428760 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In1001428760 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1001428760 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1001428760 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In1001428760 ~z$r_buff0_thd0~0_Out1001428760) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760 0)) (or (and (or (and (= ~z~0_In1001428760 ~z~0_Out1001428760) .cse0) (and .cse1 (= ~z$w_buff1~0_In1001428760 ~z~0_Out1001428760) .cse2)) .cse3) (and (= ~z~0_Out1001428760 ~z$w_buff0~0_In1001428760) .cse4 .cse5)) (or (and (= ~z$w_buff0_used~0_Out1001428760 0) .cse4 .cse5) (and (= ~z$w_buff0_used~0_Out1001428760 ~z$w_buff0_used~0_In1001428760) .cse3)) (or (and (= ~z$w_buff1_used~0_In1001428760 ~z$w_buff1_used~0_Out1001428760) .cse0) (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out1001428760 0))) (= ~z$r_buff1_thd0~0_Out1001428760 ~z$r_buff1_thd0~0_In1001428760) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1001428760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001428760, ~z$w_buff0~0=~z$w_buff0~0_In1001428760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1001428760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1001428760, ~z$w_buff1~0=~z$w_buff1~0_In1001428760, ~z~0=~z~0_In1001428760} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1001428760, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1001428760|, ~z$w_buff0~0=~z$w_buff0~0_In1001428760, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1001428760, ~z$w_buff1~0=~z$w_buff1~0_In1001428760, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1001428760|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1001428760|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1001428760|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1001428760, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1001428760|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1001428760|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1001428760, ~z~0=~z~0_Out1001428760} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-11-28 02:59:37,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,305 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 02:59:37,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:59:37 BasicIcfg [2020-11-28 02:59:37,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:59:37,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:59:37,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:59:37,415 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:59:37,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:28" (3/4) ... [2020-11-28 02:59:37,418 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:59:37,430 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L852-->L859: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In1001428760 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In1001428760 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1001428760 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1001428760 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In1001428760 ~z$r_buff0_thd0~0_Out1001428760) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760 0)) (or (and (or (and (= ~z~0_In1001428760 ~z~0_Out1001428760) .cse0) (and .cse1 (= ~z$w_buff1~0_In1001428760 ~z~0_Out1001428760) .cse2)) .cse3) (and (= ~z~0_Out1001428760 ~z$w_buff0~0_In1001428760) .cse4 .cse5)) (or (and (= ~z$w_buff0_used~0_Out1001428760 0) .cse4 .cse5) (and (= ~z$w_buff0_used~0_Out1001428760 ~z$w_buff0_used~0_In1001428760) .cse3)) (or (and (= ~z$w_buff1_used~0_In1001428760 ~z$w_buff1_used~0_Out1001428760) .cse0) (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out1001428760 0))) (= ~z$r_buff1_thd0~0_Out1001428760 ~z$r_buff1_thd0~0_In1001428760) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1001428760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001428760, ~z$w_buff0~0=~z$w_buff0~0_In1001428760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1001428760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1001428760, ~z$w_buff1~0=~z$w_buff1~0_In1001428760, ~z~0=~z~0_In1001428760} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1001428760, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1001428760|, ~z$w_buff0~0=~z$w_buff0~0_In1001428760, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1001428760, ~z$w_buff1~0=~z$w_buff1~0_In1001428760, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1001428760|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1001428760|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1001428760|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1001428760|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1001428760, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1001428760|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1001428760|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1001428760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1001428760, ~z~0=~z~0_Out1001428760} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-11-28 02:59:37,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,432 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 02:59:37,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:59:37,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:59:37,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8b8efd37-6b3c-4934-86ca-a66c9c11f72c/bin/uautomizer/witness.graphml [2020-11-28 02:59:37,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:59:37,565 INFO L168 Benchmark]: Toolchain (without parser) took 11654.14 ms. Allocated memory was 104.9 MB in the beginning and 247.5 MB in the end (delta: 142.6 MB). Free memory was 71.4 MB in the beginning and 131.6 MB in the end (delta: -60.2 MB). Peak memory consumption was 80.7 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,565 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 73.4 MB. Free memory was 34.1 MB in the beginning and 34.0 MB in the end (delta: 67.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:59:37,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.27 ms. Allocated memory is still 104.9 MB. Free memory was 71.2 MB in the beginning and 58.4 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 104.9 MB. Free memory was 58.4 MB in the beginning and 55.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,566 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 ms. Allocated memory is still 104.9 MB. Free memory was 55.7 MB in the beginning and 53.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,569 INFO L168 Benchmark]: RCFGBuilder took 2163.89 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 53.6 MB in the beginning and 46.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 41.5 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,569 INFO L168 Benchmark]: TraceAbstraction took 8571.08 ms. Allocated memory was 125.8 MB in the beginning and 247.5 MB in the end (delta: 121.6 MB). Free memory was 46.0 MB in the beginning and 148.4 MB in the end (delta: -102.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,569 INFO L168 Benchmark]: Witness Printer took 148.61 ms. Allocated memory is still 247.5 MB. Free memory was 148.4 MB in the beginning and 131.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:59:37,572 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.27 ms. Allocated memory is still 73.4 MB. Free memory was 34.1 MB in the beginning and 34.0 MB in the end (delta: 67.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 668.27 ms. Allocated memory is still 104.9 MB. Free memory was 71.2 MB in the beginning and 58.4 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 104.9 MB. Free memory was 58.4 MB in the beginning and 55.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.46 ms. Allocated memory is still 104.9 MB. Free memory was 55.7 MB in the beginning and 53.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2163.89 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 53.6 MB in the beginning and 46.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 41.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8571.08 ms. Allocated memory was 125.8 MB in the beginning and 247.5 MB in the end (delta: 121.6 MB). Free memory was 46.0 MB in the beginning and 148.4 MB in the end (delta: -102.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 16.1 GB. * Witness Printer took 148.61 ms. Allocated memory is still 247.5 MB. Free memory was 148.4 MB in the beginning and 131.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1443 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.1s, 115 PlacesBefore, 36 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 2024 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 4880 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t894; [L844] FCALL, FORK 0 pthread_create(&t894, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t895; [L846] FCALL, FORK 0 pthread_create(&t895, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] 0 pthread_t t896; [L848] FCALL, FORK 0 pthread_create(&t896, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 2 x = 2 [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1 [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1 [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 231 SDtfs, 170 SDslu, 319 SDs, 0 SdLazy, 117 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 6453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...