./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_rmo.oepc.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_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/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 71509a6be966406352dac3b3bbd7e8eabb0cad6b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:57:49,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:57:49,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:57:49,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:57:49,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:57:49,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:57:49,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:57:49,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:57:49,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:57:49,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:57:49,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:57:49,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:57:49,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:57:49,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:57:49,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:57:49,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:57:49,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:57:49,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:57:49,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:57:49,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:57:49,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:57:49,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:57:49,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:57:49,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:57:49,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:57:49,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:57:49,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:57:49,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:57:49,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:57:49,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:57:49,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:57:49,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:57:49,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:57:49,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:57:49,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:57:49,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:57:49,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:57:49,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:57:49,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:57:49,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:57:49,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:57:49,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:57:49,825 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:57:49,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:57:49,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:57:49,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:57:49,830 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:57:49,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:57:49,831 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:57:49,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:57:49,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:57:49,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:57:49,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:57:49,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:57:49,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:57:49,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:57:49,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:57:49,834 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:57:49,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:57:49,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:57:49,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:57:49,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:57:49,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:57:49,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:57:49,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:57:49,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:57:49,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:57:49,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:57:49,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:57:49,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:57:49,837 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:57:49,837 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_abc27d9a-2296-4202-b024-b293913b3611/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_abc27d9a-2296-4202-b024-b293913b3611/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 -> 71509a6be966406352dac3b3bbd7e8eabb0cad6b [2020-11-28 02:57:50,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:57:50,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:57:50,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:57:50,161 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:57:50,163 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:57:50,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix030_rmo.oepc.i [2020-11-28 02:57:50,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/data/955089b70/b6c362c1c9174aadbb8b7c5375a03485/FLAG356e86d24 [2020-11-28 02:57:50,806 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:57:50,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/sv-benchmarks/c/pthread-wmm/mix030_rmo.oepc.i [2020-11-28 02:57:50,840 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/data/955089b70/b6c362c1c9174aadbb8b7c5375a03485/FLAG356e86d24 [2020-11-28 02:57:51,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/data/955089b70/b6c362c1c9174aadbb8b7c5375a03485 [2020-11-28 02:57:51,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:57:51,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:57:51,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:51,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:57:51,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:57:51,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d19051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51, skipping insertion in model container [2020-11-28 02:57:51,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:57:51,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:57:51,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:51,669 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:57:51,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:51,812 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:57:51,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51 WrapperNode [2020-11-28 02:57:51,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:51,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:51,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:57:51,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:57:51,822 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:57:51" (1/1) ... [2020-11-28 02:57:51,841 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:57:51" (1/1) ... [2020-11-28 02:57:51,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:51,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:57:51,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:57:51,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:57:51,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... [2020-11-28 02:57:51,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:57:51,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:57:51,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:57:51,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:57:51,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/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:57:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:57:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:57:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:57:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:57:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:57:52,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:57:52,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:57:52,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:57:52,041 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:57:52,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:57:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 02:57:52,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 02:57:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:57:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:57:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:57:52,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:57:52,045 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:57:55,020 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:57:55,020 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:57:55,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:55 BoogieIcfgContainer [2020-11-28 02:57:55,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:57:55,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:57:55,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:57:55,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:57:55,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:57:51" (1/3) ... [2020-11-28 02:57:55,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a419bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:57:55, skipping insertion in model container [2020-11-28 02:57:55,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:51" (2/3) ... [2020-11-28 02:57:55,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a419bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:57:55, skipping insertion in model container [2020-11-28 02:57:55,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:55" (3/3) ... [2020-11-28 02:57:55,030 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.oepc.i [2020-11-28 02:57:55,041 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:57:55,041 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:57:55,048 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:57:55,049 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:57:55,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,113 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,113 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,138 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,142 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,153 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:57:55,158 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:57:55,169 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 02:57:55,199 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:57:55,200 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:57:55,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:57:55,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:57:55,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:57:55,200 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:57:55,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:57:55,200 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:57:55,215 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:57:55,216 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 02:57:55,220 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 02:57:55,221 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-28 02:57:55,289 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-28 02:57:55,289 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:57:55,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-11-28 02:57:55,303 INFO L116 LiptonReduction]: Number of co-enabled transitions 3014 [2020-11-28 02:57:55,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:55,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:55,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:55,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:55,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:55,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:55,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:55,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:55,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:55,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:55,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:55,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:55,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:55,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:55,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:55,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:55,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:55,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,134 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 02:57:56,253 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 02:57:56,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:57:56,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:56,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:57:56,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:56,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:57:56,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:56,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:57:56,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:56,753 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:57:56,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:56,754 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:57:56,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:56,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:57:56,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:57:56,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:57:56,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:56,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:56,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:56,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:56,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:56,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:57,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:57,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:57,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:57,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:57,387 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-28 02:57:57,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:57:57,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:57:57,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:57:57,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:57,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:57,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:57:57,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:57,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:57:57,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:57,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:57:57,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:57:57,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:57:57,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:57,574 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:57:57,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:57,577 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:57:57,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:57,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:57,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:57,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:57,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:58,079 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:57:58,197 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:57:58,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:58,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:58,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:58,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:58,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:58,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:58,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:58,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:58,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:58,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:58,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:58,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:58,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:58,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:58,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:58,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:58,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:57:58,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:57:58,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:57:58,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:57:58,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:57:58,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:57:58,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:58,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:58,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:59,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:59,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:59,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:59,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:59,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:59,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:57:59,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:57:59,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:59,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:57:59,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:57:59,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:59,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:57:59,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:57:59,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:58:00,354 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 02:58:00,460 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-28 02:58:00,881 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-28 02:58:01,118 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-28 02:58:01,124 INFO L131 LiptonReduction]: Checked pairs total: 8999 [2020-11-28 02:58:01,124 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-28 02:58:01,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-11-28 02:58:01,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-11-28 02:58:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-11-28 02:58:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 02:58:01,557 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:01,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 02:58:01,558 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1242933, now seen corresponding path program 1 times [2020-11-28 02:58:01,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:01,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716790130] [2020-11-28 02:58:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:01,802 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:58:01,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716790130] [2020-11-28 02:58:01,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:01,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:58:01,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627822396] [2020-11-28 02:58:01,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:58:01,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:58:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:58:01,825 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-11-28 02:58:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:02,028 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-11-28 02:58:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:58:02,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 02:58:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:02,154 INFO L225 Difference]: With dead ends: 4812 [2020-11-28 02:58:02,154 INFO L226 Difference]: Without dead ends: 4062 [2020-11-28 02:58:02,155 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:58:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-11-28 02:58:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-11-28 02:58:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-11-28 02:58:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-11-28 02:58:02,556 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-11-28 02:58:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:02,556 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-11-28 02:58:02,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:58:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-11-28 02:58:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 02:58:02,568 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:02,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:02,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:58:02,569 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash 194385852, now seen corresponding path program 1 times [2020-11-28 02:58:02,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:02,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971272403] [2020-11-28 02:58:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:02,755 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:58:02,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971272403] [2020-11-28 02:58:02,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:02,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:58:02,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844078633] [2020-11-28 02:58:02,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:02,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:02,758 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-11-28 02:58:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:02,925 INFO L93 Difference]: Finished difference Result 4692 states and 18054 transitions. [2020-11-28 02:58:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:02,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 02:58:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:02,967 INFO L225 Difference]: With dead ends: 4692 [2020-11-28 02:58:02,968 INFO L226 Difference]: Without dead ends: 3942 [2020-11-28 02:58:02,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:58:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2020-11-28 02:58:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2020-11-28 02:58:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2020-11-28 02:58:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 15569 transitions. [2020-11-28 02:58:03,163 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 15569 transitions. Word has length 12 [2020-11-28 02:58:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:03,164 INFO L481 AbstractCegarLoop]: Abstraction has 3942 states and 15569 transitions. [2020-11-28 02:58:03,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 15569 transitions. [2020-11-28 02:58:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 02:58:03,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:03,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:03,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:58:03,168 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1448209680, now seen corresponding path program 1 times [2020-11-28 02:58:03,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43400539] [2020-11-28 02:58:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:03,345 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:58:03,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43400539] [2020-11-28 02:58:03,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:03,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:58:03,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452715665] [2020-11-28 02:58:03,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:03,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:03,348 INFO L87 Difference]: Start difference. First operand 3942 states and 15569 transitions. Second operand 4 states. [2020-11-28 02:58:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:03,423 INFO L93 Difference]: Finished difference Result 4446 states and 17087 transitions. [2020-11-28 02:58:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:03,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 02:58:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:03,463 INFO L225 Difference]: With dead ends: 4446 [2020-11-28 02:58:03,463 INFO L226 Difference]: Without dead ends: 3846 [2020-11-28 02:58:03,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:58:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2020-11-28 02:58:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3846. [2020-11-28 02:58:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3846 states. [2020-11-28 02:58:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 15129 transitions. [2020-11-28 02:58:03,716 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 15129 transitions. Word has length 13 [2020-11-28 02:58:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:03,717 INFO L481 AbstractCegarLoop]: Abstraction has 3846 states and 15129 transitions. [2020-11-28 02:58:03,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 15129 transitions. [2020-11-28 02:58:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:58:03,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:03,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:03,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:58:03,721 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1656832375, now seen corresponding path program 1 times [2020-11-28 02:58:03,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578094103] [2020-11-28 02:58:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:03,831 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:58:03,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578094103] [2020-11-28 02:58:03,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:03,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:58:03,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004268829] [2020-11-28 02:58:03,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:03,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:03,834 INFO L87 Difference]: Start difference. First operand 3846 states and 15129 transitions. Second operand 4 states. [2020-11-28 02:58:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:03,905 INFO L93 Difference]: Finished difference Result 4060 states and 15522 transitions. [2020-11-28 02:58:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:03,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 02:58:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:03,948 INFO L225 Difference]: With dead ends: 4060 [2020-11-28 02:58:03,948 INFO L226 Difference]: Without dead ends: 3418 [2020-11-28 02:58:03,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:58:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2020-11-28 02:58:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3418. [2020-11-28 02:58:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2020-11-28 02:58:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 13273 transitions. [2020-11-28 02:58:04,109 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 13273 transitions. Word has length 14 [2020-11-28 02:58:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:04,110 INFO L481 AbstractCegarLoop]: Abstraction has 3418 states and 13273 transitions. [2020-11-28 02:58:04,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 13273 transitions. [2020-11-28 02:58:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 02:58:04,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:04,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:04,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:58:04,116 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1957044980, now seen corresponding path program 1 times [2020-11-28 02:58:04,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:04,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574455331] [2020-11-28 02:58:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:04,240 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:58:04,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574455331] [2020-11-28 02:58:04,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:04,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:04,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363093340] [2020-11-28 02:58:04,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:04,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:04,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:04,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:04,242 INFO L87 Difference]: Start difference. First operand 3418 states and 13273 transitions. Second operand 4 states. [2020-11-28 02:58:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:04,350 INFO L93 Difference]: Finished difference Result 5518 states and 20748 transitions. [2020-11-28 02:58:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:04,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-28 02:58:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:04,381 INFO L225 Difference]: With dead ends: 5518 [2020-11-28 02:58:04,382 INFO L226 Difference]: Without dead ends: 3778 [2020-11-28 02:58:04,382 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:58:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2020-11-28 02:58:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3298. [2020-11-28 02:58:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3298 states. [2020-11-28 02:58:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 12367 transitions. [2020-11-28 02:58:04,521 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 12367 transitions. Word has length 16 [2020-11-28 02:58:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:04,521 INFO L481 AbstractCegarLoop]: Abstraction has 3298 states and 12367 transitions. [2020-11-28 02:58:04,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 12367 transitions. [2020-11-28 02:58:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 02:58:04,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:04,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:04,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:58:04,526 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1835634052, now seen corresponding path program 1 times [2020-11-28 02:58:04,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:04,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588980574] [2020-11-28 02:58:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:04,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:58:04,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588980574] [2020-11-28 02:58:04,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:04,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:04,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589720281] [2020-11-28 02:58:04,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:04,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:04,641 INFO L87 Difference]: Start difference. First operand 3298 states and 12367 transitions. Second operand 4 states. [2020-11-28 02:58:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:04,710 INFO L93 Difference]: Finished difference Result 3156 states and 10652 transitions. [2020-11-28 02:58:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:58:04,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-28 02:58:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:04,721 INFO L225 Difference]: With dead ends: 3156 [2020-11-28 02:58:04,721 INFO L226 Difference]: Without dead ends: 2406 [2020-11-28 02:58:04,722 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:58:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2020-11-28 02:58:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2406. [2020-11-28 02:58:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2020-11-28 02:58:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 8027 transitions. [2020-11-28 02:58:04,805 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 8027 transitions. Word has length 16 [2020-11-28 02:58:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:04,805 INFO L481 AbstractCegarLoop]: Abstraction has 2406 states and 8027 transitions. [2020-11-28 02:58:04,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 8027 transitions. [2020-11-28 02:58:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 02:58:04,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:04,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:04,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:58:04,814 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1201451582, now seen corresponding path program 1 times [2020-11-28 02:58:04,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:04,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639832786] [2020-11-28 02:58:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:04,985 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:58:04,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639832786] [2020-11-28 02:58:04,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:04,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:58:04,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470285949] [2020-11-28 02:58:04,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:58:04,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:58:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:58:04,987 INFO L87 Difference]: Start difference. First operand 2406 states and 8027 transitions. Second operand 5 states. [2020-11-28 02:58:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:05,063 INFO L93 Difference]: Finished difference Result 1916 states and 5830 transitions. [2020-11-28 02:58:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:58:05,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-28 02:58:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:05,070 INFO L225 Difference]: With dead ends: 1916 [2020-11-28 02:58:05,070 INFO L226 Difference]: Without dead ends: 1486 [2020-11-28 02:58:05,071 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:58:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-11-28 02:58:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2020-11-28 02:58:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2020-11-28 02:58:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 4441 transitions. [2020-11-28 02:58:05,119 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 4441 transitions. Word has length 19 [2020-11-28 02:58:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:05,119 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 4441 transitions. [2020-11-28 02:58:05,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:58:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 4441 transitions. [2020-11-28 02:58:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 02:58:05,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:05,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:05,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:58:05,124 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2031002221, now seen corresponding path program 1 times [2020-11-28 02:58:05,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:05,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844584715] [2020-11-28 02:58:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,302 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:58:05,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844584715] [2020-11-28 02:58:05,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:05,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:58:05,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486766630] [2020-11-28 02:58:05,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:58:05,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:58:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:58:05,304 INFO L87 Difference]: Start difference. First operand 1486 states and 4441 transitions. Second operand 6 states. [2020-11-28 02:58:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:05,395 INFO L93 Difference]: Finished difference Result 1254 states and 3719 transitions. [2020-11-28 02:58:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:58:05,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-28 02:58:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:05,400 INFO L225 Difference]: With dead ends: 1254 [2020-11-28 02:58:05,400 INFO L226 Difference]: Without dead ends: 1128 [2020-11-28 02:58:05,400 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:58:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2020-11-28 02:58:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2020-11-28 02:58:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2020-11-28 02:58:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3391 transitions. [2020-11-28 02:58:05,434 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3391 transitions. Word has length 22 [2020-11-28 02:58:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:05,434 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 3391 transitions. [2020-11-28 02:58:05,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:58:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3391 transitions. [2020-11-28 02:58:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 02:58:05,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:05,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:05,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:58:05,438 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1104598437, now seen corresponding path program 1 times [2020-11-28 02:58:05,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:05,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154951979] [2020-11-28 02:58:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,571 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:58:05,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154951979] [2020-11-28 02:58:05,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:05,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:05,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193926364] [2020-11-28 02:58:05,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:05,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:05,573 INFO L87 Difference]: Start difference. First operand 1128 states and 3391 transitions. Second operand 4 states. [2020-11-28 02:58:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:05,627 INFO L93 Difference]: Finished difference Result 1553 states and 4556 transitions. [2020-11-28 02:58:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:58:05,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-28 02:58:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:05,632 INFO L225 Difference]: With dead ends: 1553 [2020-11-28 02:58:05,632 INFO L226 Difference]: Without dead ends: 1084 [2020-11-28 02:58:05,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:58:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-11-28 02:58:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1078. [2020-11-28 02:58:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2020-11-28 02:58:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3099 transitions. [2020-11-28 02:58:05,663 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3099 transitions. Word has length 25 [2020-11-28 02:58:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:05,665 INFO L481 AbstractCegarLoop]: Abstraction has 1078 states and 3099 transitions. [2020-11-28 02:58:05,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3099 transitions. [2020-11-28 02:58:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 02:58:05,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:05,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:05,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:58:05,669 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 409491559, now seen corresponding path program 2 times [2020-11-28 02:58:05,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:05,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037568264] [2020-11-28 02:58:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,853 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:58:05,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037568264] [2020-11-28 02:58:05,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:05,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:58:05,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444860058] [2020-11-28 02:58:05,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:58:05,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:05,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:58:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:58:05,855 INFO L87 Difference]: Start difference. First operand 1078 states and 3099 transitions. Second operand 7 states. [2020-11-28 02:58:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:05,984 INFO L93 Difference]: Finished difference Result 1034 states and 3011 transitions. [2020-11-28 02:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:05,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-28 02:58:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:05,987 INFO L225 Difference]: With dead ends: 1034 [2020-11-28 02:58:05,987 INFO L226 Difference]: Without dead ends: 546 [2020-11-28 02:58:05,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:58:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-11-28 02:58:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2020-11-28 02:58:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-11-28 02:58:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1593 transitions. [2020-11-28 02:58:06,004 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1593 transitions. Word has length 25 [2020-11-28 02:58:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:06,005 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1593 transitions. [2020-11-28 02:58:06,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:58:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1593 transitions. [2020-11-28 02:58:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-28 02:58:06,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:06,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:06,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:58:06,009 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1129507379, now seen corresponding path program 1 times [2020-11-28 02:58:06,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956172413] [2020-11-28 02:58:06,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:06,148 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:58:06,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956172413] [2020-11-28 02:58:06,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:06,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:58:06,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525831262] [2020-11-28 02:58:06,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:58:06,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:06,150 INFO L87 Difference]: Start difference. First operand 546 states and 1593 transitions. Second operand 4 states. [2020-11-28 02:58:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:06,193 INFO L93 Difference]: Finished difference Result 852 states and 2458 transitions. [2020-11-28 02:58:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:58:06,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-28 02:58:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:06,195 INFO L225 Difference]: With dead ends: 852 [2020-11-28 02:58:06,195 INFO L226 Difference]: Without dead ends: 344 [2020-11-28 02:58:06,196 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:58:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-11-28 02:58:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-11-28 02:58:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-11-28 02:58:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2020-11-28 02:58:06,206 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 29 [2020-11-28 02:58:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:06,206 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2020-11-28 02:58:06,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:58:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2020-11-28 02:58:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-28 02:58:06,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:06,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:06,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:58:06,210 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1565216245, now seen corresponding path program 2 times [2020-11-28 02:58:06,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282535027] [2020-11-28 02:58:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:06,502 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:58:06,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282535027] [2020-11-28 02:58:06,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:06,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 02:58:06,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292372102] [2020-11-28 02:58:06,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:58:06,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:06,505 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand 9 states. [2020-11-28 02:58:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:06,765 INFO L93 Difference]: Finished difference Result 401 states and 1079 transitions. [2020-11-28 02:58:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:58:06,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-28 02:58:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:58:06,767 INFO L225 Difference]: With dead ends: 401 [2020-11-28 02:58:06,767 INFO L226 Difference]: Without dead ends: 182 [2020-11-28 02:58:06,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-11-28 02:58:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-11-28 02:58:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-28 02:58:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 425 transitions. [2020-11-28 02:58:06,772 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 425 transitions. Word has length 29 [2020-11-28 02:58:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:58:06,772 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 425 transitions. [2020-11-28 02:58:06,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:58:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 425 transitions. [2020-11-28 02:58:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-28 02:58:06,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:58:06,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:06,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:58:06,774 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:58:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,776 INFO L82 PathProgramCache]: Analyzing trace with hash -785249075, now seen corresponding path program 3 times [2020-11-28 02:58:06,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748122055] [2020-11-28 02:58:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:06,953 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:58:06,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 02:58:06,992 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:58:06,992 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [747] [2020-11-28 02:58:06,993 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:58:06,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,993 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:58:06,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,993 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:58:06,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,994 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:58:06,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,994 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:58:06,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,994 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:58:06,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,997 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:58:06,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,997 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:58:06,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,997 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:58:06,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,997 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:58:06,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,998 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:58:06,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,998 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:58:06,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,999 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:58:06,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,999 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:58:06,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:06,999 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:58:06,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,000 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:58:07,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,004 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:58:07,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,005 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:58:07,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,005 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:58:07,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,005 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:58:07,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,005 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:58:07,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,006 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:58:07,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,006 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:58:07,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,006 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:58:07,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,006 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:58:07,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,007 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:58:07,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,007 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:58:07,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,007 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:58:07,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,008 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:58:07,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,008 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:58:07,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,008 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:58:07,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,009 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:58:07,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,009 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:58:07,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,009 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:58:07,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,009 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:58:07,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,010 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:58:07,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,010 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:58:07,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,010 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:58:07,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,011 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:58:07,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,011 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:58:07,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:58:07 BasicIcfg [2020-11-28 02:58:07,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:58:07,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:58:07,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:58:07,122 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:58:07,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:55" (3/4) ... [2020-11-28 02:58:07,125 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:58:07,163 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:58:07,163 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [747] [2020-11-28 02:58:07,163 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:58:07,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,164 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:58:07,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,164 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:58:07,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,164 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:58:07,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,164 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:58:07,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,165 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:58:07,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,165 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:58:07,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,166 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:58:07,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,166 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:58:07,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,166 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:58:07,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,167 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:58:07,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,167 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:58:07,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,168 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:58:07,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,168 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:58:07,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,168 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:58:07,168 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,169 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:58:07,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,169 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:58:07,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,169 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:58:07,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,169 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:58:07,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,170 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:58:07,170 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,170 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:58:07,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,171 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:58:07,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,171 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:58:07,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,171 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:58:07,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,172 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:58:07,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,172 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:58:07,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,172 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:58:07,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,173 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:58:07,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,173 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:58:07,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,173 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:58:07,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,174 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:58:07,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,174 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:58:07,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,174 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:58:07,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,175 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:58:07,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,175 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:58:07,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,175 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:58:07,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,176 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:58:07,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,176 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:58:07,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,176 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:58:07,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,177 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:58:07,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:58:07,302 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_abc27d9a-2296-4202-b024-b293913b3611/bin/uautomizer/witness.graphml [2020-11-28 02:58:07,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:58:07,304 INFO L168 Benchmark]: Toolchain (without parser) took 16246.23 ms. Allocated memory was 104.9 MB in the beginning and 736.1 MB in the end (delta: 631.2 MB). Free memory was 67.1 MB in the beginning and 604.0 MB in the end (delta: -536.8 MB). Peak memory consumption was 261.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,305 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 104.9 MB. Free memory was 85.4 MB in the beginning and 85.3 MB in the end (delta: 54.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:58:07,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.33 ms. Allocated memory is still 104.9 MB. Free memory was 66.9 MB in the beginning and 56.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.72 ms. Allocated memory is still 104.9 MB. Free memory was 56.1 MB in the beginning and 53.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,306 INFO L168 Benchmark]: Boogie Preprocessor took 58.32 ms. Allocated memory is still 104.9 MB. Free memory was 53.7 MB in the beginning and 51.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,306 INFO L168 Benchmark]: RCFGBuilder took 3093.23 ms. Allocated memory was 104.9 MB in the beginning and 144.7 MB in the end (delta: 39.8 MB). Free memory was 51.1 MB in the beginning and 107.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,307 INFO L168 Benchmark]: TraceAbstraction took 12097.58 ms. Allocated memory was 144.7 MB in the beginning and 444.6 MB in the end (delta: 299.9 MB). Free memory was 107.2 MB in the beginning and 157.9 MB in the end (delta: -50.7 MB). Peak memory consumption was 249.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,307 INFO L168 Benchmark]: Witness Printer took 181.03 ms. Allocated memory was 444.6 MB in the beginning and 736.1 MB in the end (delta: 291.5 MB). Free memory was 157.9 MB in the beginning and 604.0 MB in the end (delta: -446.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:07,310 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.24 ms. Allocated memory is still 104.9 MB. Free memory was 85.4 MB in the beginning and 85.3 MB in the end (delta: 54.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 752.33 ms. Allocated memory is still 104.9 MB. Free memory was 66.9 MB in the beginning and 56.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.72 ms. Allocated memory is still 104.9 MB. Free memory was 56.1 MB in the beginning and 53.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.32 ms. Allocated memory is still 104.9 MB. Free memory was 53.7 MB in the beginning and 51.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3093.23 ms. Allocated memory was 104.9 MB in the beginning and 144.7 MB in the end (delta: 39.8 MB). Free memory was 51.1 MB in the beginning and 107.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12097.58 ms. Allocated memory was 144.7 MB in the beginning and 444.6 MB in the end (delta: 299.9 MB). Free memory was 107.2 MB in the beginning and 157.9 MB in the end (delta: -50.7 MB). Peak memory consumption was 249.3 MB. Max. memory is 16.1 GB. * Witness Printer took 181.03 ms. Allocated memory was 444.6 MB in the beginning and 736.1 MB in the end (delta: 291.5 MB). Free memory was 157.9 MB in the beginning and 604.0 MB in the end (delta: -446.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1946 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 230 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 130 PlacesBefore, 48 PlacesAfterwards, 120 TransitionsBefore, 36 TransitionsAfterwards, 3014 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 8999 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t817; [L863] FCALL, FORK 0 pthread_create(&t817, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t818; [L865] FCALL, FORK 0 pthread_create(&t818, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t819; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L867] FCALL, FORK 0 pthread_create(&t819, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t820; [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L869] FCALL, FORK 0 pthread_create(&t820, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L818] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L829] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L832] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L832] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L833] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L833] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 517 SDtfs, 591 SDslu, 965 SDs, 0 SdLazy, 276 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 486 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 20057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...