./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.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_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/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 97f9f642d9d92e1d6667e48f135815179e9f3609 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:14:15,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:14:15,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:14:15,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:14:15,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:14:15,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:14:15,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:14:15,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:14:15,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:14:15,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:14:15,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:14:15,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:14:15,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:14:15,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:14:15,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:14:15,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:14:15,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:14:15,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:14:15,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:14:15,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:14:15,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:14:15,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:14:15,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:14:15,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:14:15,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:14:15,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:14:15,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:14:15,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:14:15,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:14:15,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:14:15,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:14:15,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:14:15,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:14:15,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:14:15,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:14:15,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:14:15,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:14:15,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:14:15,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:14:15,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:14:15,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:14:15,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:14:16,020 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:14:16,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:14:16,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:14:16,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:14:16,024 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:14:16,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:14:16,024 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:14:16,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:14:16,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:14:16,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:14:16,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:14:16,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:14:16,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:14:16,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:14:16,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:14:16,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:14:16,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:14:16,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:14:16,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:14:16,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:14:16,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:14:16,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:14:16,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:14:16,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:14:16,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:14:16,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:14:16,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:14:16,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:14:16,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:14:16,032 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_3f29c689-37fc-4982-9c2e-f9a597302c99/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_3f29c689-37fc-4982-9c2e-f9a597302c99/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 -> 97f9f642d9d92e1d6667e48f135815179e9f3609 [2020-11-28 03:14:16,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:14:16,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:14:16,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:14:16,439 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:14:16,440 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:14:16,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc.i [2020-11-28 03:14:16,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/data/69205e1af/33fb5a1197874fe8b963208005cc8586/FLAG5b406c857 [2020-11-28 03:14:17,374 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:14:17,375 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc.i [2020-11-28 03:14:17,412 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/data/69205e1af/33fb5a1197874fe8b963208005cc8586/FLAG5b406c857 [2020-11-28 03:14:17,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/data/69205e1af/33fb5a1197874fe8b963208005cc8586 [2020-11-28 03:14:17,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:14:17,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:14:17,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:14:17,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:14:17,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:14:17,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:14:17" (1/1) ... [2020-11-28 03:14:17,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376a11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:17, skipping insertion in model container [2020-11-28 03:14:17,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:14:17" (1/1) ... [2020-11-28 03:14:17,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:14:17,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:14:18,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:14:18,372 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:14:18,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:14:18,553 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:14:18,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18 WrapperNode [2020-11-28 03:14:18,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:14:18,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:14:18,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:14:18,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:14:18,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:14:18,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:14:18,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:14:18,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:14:18,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... [2020-11-28 03:14:18,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:14:18,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:14:18,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:14:18,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:14:18,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/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 03:14:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:14:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:14:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:14:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:14:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:14:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:14:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:14:18,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:14:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:14:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:14:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:14:18,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:14:18,829 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 03:14:22,022 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:14:22,023 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:14:22,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:14:22 BoogieIcfgContainer [2020-11-28 03:14:22,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:14:22,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:14:22,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:14:22,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:14:22,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:14:17" (1/3) ... [2020-11-28 03:14:22,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db752a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:14:22, skipping insertion in model container [2020-11-28 03:14:22,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:14:18" (2/3) ... [2020-11-28 03:14:22,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db752a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:14:22, skipping insertion in model container [2020-11-28 03:14:22,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:14:22" (3/3) ... [2020-11-28 03:14:22,035 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi007_pso.oepc.i [2020-11-28 03:14:22,047 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:14:22,048 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:14:22,053 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:14:22,054 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:14:22,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,180 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:14:22,188 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:14:22,201 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-28 03:14:22,239 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:14:22,239 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:14:22,239 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:14:22,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:14:22,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:14:22,240 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:14:22,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:14:22,240 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:14:22,261 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:14:22,264 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 86 transitions, 182 flow [2020-11-28 03:14:22,268 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 86 transitions, 182 flow [2020-11-28 03:14:22,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 86 transitions, 182 flow [2020-11-28 03:14:22,335 INFO L129 PetriNetUnfolder]: 3/84 cut-off events. [2020-11-28 03:14:22,336 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:14:22,342 INFO L80 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 3/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2020-11-28 03:14:22,348 INFO L116 LiptonReduction]: Number of co-enabled transitions 1120 [2020-11-28 03:14:22,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:22,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:22,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:22,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:22,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:22,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,174 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-28 03:14:23,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:23,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:23,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:23,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:23,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:23,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:23,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,404 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 03:14:23,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,408 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 03:14:23,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:14:23,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:14:23,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:23,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:23,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:23,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:14:23,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,144 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 03:14:24,274 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 03:14:24,697 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:14:24,827 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:14:24,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:24,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:24,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:24,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:24,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:24,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:24,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:24,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:24,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:25,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:25,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:25,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:25,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:25,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:25,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:25,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:14:25,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:25,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:25,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:25,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:14:25,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:25,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 03:14:25,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:26,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:14:26,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:14:26,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:26,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:26,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:26,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:26,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:26,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:26,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:26,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,088 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 03:14:26,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:26,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,841 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-28 03:14:26,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:26,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:26,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:26,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:26,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:26,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:27,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:27,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:27,255 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-11-28 03:14:27,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:27,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:27,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:27,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:14:27,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:14:27,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:27,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:14:27,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:14:27,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:27,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:27,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:27,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:27,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:27,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:27,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:27,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:27,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:27,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:27,832 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 03:14:27,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:27,834 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 03:14:27,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:28,268 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-28 03:14:28,418 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-28 03:14:28,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:14:28,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:28,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:28,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:28,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:28,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:28,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:14:28,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:14:28,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:14:28,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:28,466 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 03:14:28,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:28,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:28,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:14:28,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:14:28,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:14:28,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:14:28,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:14:28,727 INFO L131 LiptonReduction]: Checked pairs total: 3575 [2020-11-28 03:14:28,727 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-11-28 03:14:28,733 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2020-11-28 03:14:28,761 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2020-11-28 03:14:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-11-28 03:14:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 03:14:28,768 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:28,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 03:14:28,769 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 953712, now seen corresponding path program 1 times [2020-11-28 03:14:28,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:28,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766495212] [2020-11-28 03:14:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:29,067 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 03:14:29,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766495212] [2020-11-28 03:14:29,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:29,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:14:29,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319335144] [2020-11-28 03:14:29,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:29,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:29,096 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-11-28 03:14:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:29,182 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-11-28 03:14:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:29,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 03:14:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:29,205 INFO L225 Difference]: With dead ends: 162 [2020-11-28 03:14:29,206 INFO L226 Difference]: Without dead ends: 132 [2020-11-28 03:14:29,207 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 03:14:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-28 03:14:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-28 03:14:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-28 03:14:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-11-28 03:14:29,285 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3 [2020-11-28 03:14:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:29,286 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-11-28 03:14:29,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-11-28 03:14:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 03:14:29,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:29,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:29,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:14:29,287 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash 362410442, now seen corresponding path program 1 times [2020-11-28 03:14:29,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:29,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272187618] [2020-11-28 03:14:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:29,421 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 03:14:29,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272187618] [2020-11-28 03:14:29,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:29,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:14:29,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105634930] [2020-11-28 03:14:29,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:29,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:29,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:29,425 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-11-28 03:14:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:29,441 INFO L93 Difference]: Finished difference Result 130 states and 300 transitions. [2020-11-28 03:14:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:29,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 03:14:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:29,448 INFO L225 Difference]: With dead ends: 130 [2020-11-28 03:14:29,448 INFO L226 Difference]: Without dead ends: 130 [2020-11-28 03:14:29,449 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 03:14:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-28 03:14:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-11-28 03:14:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-28 03:14:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 300 transitions. [2020-11-28 03:14:29,470 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 300 transitions. Word has length 7 [2020-11-28 03:14:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:29,470 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 300 transitions. [2020-11-28 03:14:29,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 300 transitions. [2020-11-28 03:14:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 03:14:29,472 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:29,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:29,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:14:29,473 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1650210151, now seen corresponding path program 1 times [2020-11-28 03:14:29,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:29,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888484429] [2020-11-28 03:14:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:29,578 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 03:14:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888484429] [2020-11-28 03:14:29,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:29,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:14:29,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227773292] [2020-11-28 03:14:29,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:14:29,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:14:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:14:29,580 INFO L87 Difference]: Start difference. First operand 130 states and 300 transitions. Second operand 3 states. [2020-11-28 03:14:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:29,591 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-11-28 03:14:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:14:29,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-28 03:14:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:29,597 INFO L225 Difference]: With dead ends: 122 [2020-11-28 03:14:29,597 INFO L226 Difference]: Without dead ends: 122 [2020-11-28 03:14:29,597 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 03:14:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-28 03:14:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-28 03:14:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-28 03:14:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-11-28 03:14:29,613 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 8 [2020-11-28 03:14:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:29,613 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-11-28 03:14:29,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:14:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-11-28 03:14:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:14:29,615 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:29,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:29,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:14:29,616 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 383091255, now seen corresponding path program 1 times [2020-11-28 03:14:29,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:29,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2585162] [2020-11-28 03:14:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:29,729 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 03:14:29,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2585162] [2020-11-28 03:14:29,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:29,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:14:29,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431023379] [2020-11-28 03:14:29,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:14:29,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:14:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:14:29,731 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 4 states. [2020-11-28 03:14:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:29,793 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2020-11-28 03:14:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:14:29,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-28 03:14:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:29,797 INFO L225 Difference]: With dead ends: 100 [2020-11-28 03:14:29,797 INFO L226 Difference]: Without dead ends: 70 [2020-11-28 03:14:29,798 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 03:14:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-28 03:14:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-28 03:14:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-28 03:14:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2020-11-28 03:14:29,804 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9 [2020-11-28 03:14:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:29,805 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2020-11-28 03:14:29,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:14:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2020-11-28 03:14:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:14:29,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:29,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:29,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:14:29,806 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 721525762, now seen corresponding path program 1 times [2020-11-28 03:14:29,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:29,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370658574] [2020-11-28 03:14:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:30,045 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 03:14:30,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370658574] [2020-11-28 03:14:30,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:30,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:30,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517296912] [2020-11-28 03:14:30,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:14:30,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:30,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:14:30,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:30,047 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states. [2020-11-28 03:14:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:30,133 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2020-11-28 03:14:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:14:30,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:14:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:30,135 INFO L225 Difference]: With dead ends: 55 [2020-11-28 03:14:30,135 INFO L226 Difference]: Without dead ends: 45 [2020-11-28 03:14:30,135 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 03:14:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-28 03:14:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-28 03:14:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-28 03:14:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-11-28 03:14:30,139 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2020-11-28 03:14:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:30,139 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-11-28 03:14:30,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:14:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-11-28 03:14:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:14:30,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:30,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:30,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:14:30,141 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1500000036, now seen corresponding path program 1 times [2020-11-28 03:14:30,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:30,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843982809] [2020-11-28 03:14:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:14:30,408 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 03:14:30,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843982809] [2020-11-28 03:14:30,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:14:30,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:14:30,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369418489] [2020-11-28 03:14:30,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:14:30,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:14:30,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:14:30,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:14:30,410 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 5 states. [2020-11-28 03:14:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:14:30,562 INFO L93 Difference]: Finished difference Result 66 states and 100 transitions. [2020-11-28 03:14:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:14:30,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 03:14:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:14:30,563 INFO L225 Difference]: With dead ends: 66 [2020-11-28 03:14:30,563 INFO L226 Difference]: Without dead ends: 48 [2020-11-28 03:14:30,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:14:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-28 03:14:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-11-28 03:14:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-28 03:14:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-11-28 03:14:30,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16 [2020-11-28 03:14:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:14:30,568 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-11-28 03:14:30,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:14:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-11-28 03:14:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:14:30,569 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:14:30,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:14:30,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:14:30,569 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:14:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:14:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1871859492, now seen corresponding path program 2 times [2020-11-28 03:14:30,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:14:30,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737191447] [2020-11-28 03:14:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:14:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:14:30,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:14:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:14:30,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:14:30,826 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:14:30,827 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:14:30,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:14:30,829 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:14:30,849 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L817-->L824: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In2098742564 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In2098742564 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In2098742564 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In2098742564 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff0_used~0_Out2098742564 ~x$w_buff0_used~0_In2098742564)) (and .cse1 (= ~x$w_buff0_used~0_Out2098742564 0) .cse2)) (or (and (or (and .cse3 .cse4 (= ~x$w_buff1~0_In2098742564 ~x~0_Out2098742564)) (and (= ~x~0_In2098742564 ~x~0_Out2098742564) .cse5)) .cse0) (and .cse1 .cse2 (= ~x$w_buff0~0_In2098742564 ~x~0_Out2098742564))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564 0)) (= ~x$r_buff1_thd0~0_Out2098742564 ~x$r_buff1_thd0~0_In2098742564) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|) (= ~x$r_buff0_thd0~0_In2098742564 ~x$r_buff0_thd0~0_Out2098742564) (or (and (= ~x$w_buff1_used~0_In2098742564 ~x$w_buff1_used~0_Out2098742564) .cse5) (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out2098742564 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2098742564, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2098742564, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|, ~x$w_buff1~0=~x$w_buff1~0_In2098742564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2098742564, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2098742564, ~x~0=~x~0_In2098742564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2098742564} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2098742564, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out2098742564, ~x$w_buff1~0=~x$w_buff1~0_In2098742564, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2098742564|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out2098742564, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2098742564|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out2098742564, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2098742564|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2098742564|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2098742564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out2098742564, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2098742564|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564, ~x~0=~x~0_Out2098742564} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite47, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2020-11-28 03:14:30,854 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 03:14:30,855 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [737] [2020-11-28 03:14:30,860 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 03:14:30,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,860 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 03:14:30,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,861 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 03:14:30,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,862 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 03:14:30,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,863 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 03:14:30,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,864 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 03:14:30,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,864 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 03:14:30,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,865 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 03:14:30,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,865 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 03:14:30,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,866 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 03:14:30,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,867 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 03:14:30,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,867 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 03:14:30,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,868 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 03:14:30,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,869 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 03:14:30,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,869 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 03:14:30,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,869 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 03:14:30,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,870 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 03:14:30,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,870 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 03:14:30,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,876 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 03:14:30,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,877 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 03:14:30,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,877 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 03:14:30,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,878 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 03:14:30,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,878 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 03:14:30,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:14:30 BasicIcfg [2020-11-28 03:14:30,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:14:30,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:14:30,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:14:30,970 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:14:30,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:14:22" (3/4) ... [2020-11-28 03:14:30,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:14:30,989 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L817-->L824: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In2098742564 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In2098742564 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In2098742564 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In2098742564 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff0_used~0_Out2098742564 ~x$w_buff0_used~0_In2098742564)) (and .cse1 (= ~x$w_buff0_used~0_Out2098742564 0) .cse2)) (or (and (or (and .cse3 .cse4 (= ~x$w_buff1~0_In2098742564 ~x~0_Out2098742564)) (and (= ~x~0_In2098742564 ~x~0_Out2098742564) .cse5)) .cse0) (and .cse1 .cse2 (= ~x$w_buff0~0_In2098742564 ~x~0_Out2098742564))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564 0)) (= ~x$r_buff1_thd0~0_Out2098742564 ~x$r_buff1_thd0~0_In2098742564) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|) (= ~x$r_buff0_thd0~0_In2098742564 ~x$r_buff0_thd0~0_Out2098742564) (or (and (= ~x$w_buff1_used~0_In2098742564 ~x$w_buff1_used~0_Out2098742564) .cse5) (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out2098742564 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2098742564, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2098742564, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|, ~x$w_buff1~0=~x$w_buff1~0_In2098742564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2098742564, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2098742564, ~x~0=~x~0_In2098742564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2098742564} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2098742564, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out2098742564, ~x$w_buff1~0=~x$w_buff1~0_In2098742564, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2098742564|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out2098742564, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2098742564|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out2098742564, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2098742564|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2098742564|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2098742564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out2098742564, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2098742564|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2098742564|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2098742564, ~x~0=~x~0_Out2098742564} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite47, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2020-11-28 03:14:30,991 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 03:14:30,992 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [737] [2020-11-28 03:14:30,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 03:14:30,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,995 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 03:14:30,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,995 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 03:14:30,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,995 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 03:14:30,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,996 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 03:14:30,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,996 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 03:14:30,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:30,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:30,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 03:14:31,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,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 03:14:31,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,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 03:14:31,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,001 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 03:14:31,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,001 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 03:14:31,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,001 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 03:14:31,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:14:31,118 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f29c689-37fc-4982-9c2e-f9a597302c99/bin/uautomizer/witness.graphml [2020-11-28 03:14:31,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:14:31,120 INFO L168 Benchmark]: Toolchain (without parser) took 13531.46 ms. Allocated memory was 86.0 MB in the beginning and 195.0 MB in the end (delta: 109.1 MB). Free memory was 54.7 MB in the beginning and 107.3 MB in the end (delta: -52.6 MB). Peak memory consumption was 55.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,120 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 86.0 MB. Free memory was 42.4 MB in the beginning and 42.3 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:14:31,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 958.91 ms. Allocated memory is still 86.0 MB. Free memory was 54.5 MB in the beginning and 40.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 86.0 MB. Free memory was 40.0 MB in the beginning and 37.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,122 INFO L168 Benchmark]: Boogie Preprocessor took 48.82 ms. Allocated memory is still 86.0 MB. Free memory was 37.5 MB in the beginning and 35.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,122 INFO L168 Benchmark]: RCFGBuilder took 3352.12 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 35.4 MB in the beginning and 32.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,125 INFO L168 Benchmark]: TraceAbstraction took 8942.18 ms. Allocated memory was 104.9 MB in the beginning and 195.0 MB in the end (delta: 90.2 MB). Free memory was 31.2 MB in the beginning and 119.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,126 INFO L168 Benchmark]: Witness Printer took 148.61 ms. Allocated memory is still 195.0 MB. Free memory was 119.9 MB in the beginning and 107.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:14:31,129 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.29 ms. Allocated memory is still 86.0 MB. Free memory was 42.4 MB in the beginning and 42.3 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 958.91 ms. Allocated memory is still 86.0 MB. Free memory was 54.5 MB in the beginning and 40.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 86.0 MB. Free memory was 40.0 MB in the beginning and 37.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.82 ms. Allocated memory is still 86.0 MB. Free memory was 37.5 MB in the beginning and 35.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3352.12 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 35.4 MB in the beginning and 32.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8942.18 ms. Allocated memory was 104.9 MB in the beginning and 195.0 MB in the end (delta: 90.2 MB). Free memory was 31.2 MB in the beginning and 119.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. * Witness Printer took 148.61 ms. Allocated memory is still 195.0 MB. Free memory was 119.9 MB in the beginning and 107.3 MB in the end (delta: 12.6 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 803 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 102 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.4s, 90 PlacesBefore, 27 PlacesAfterwards, 86 TransitionsBefore, 21 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3575 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1709; [L811] FCALL, FORK 0 pthread_create(&t1709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t1710; [L813] FCALL, FORK 0 pthread_create(&t1710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi007_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 84 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 113 SDtfs, 71 SDslu, 149 SDs, 0 SdLazy, 82 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 2316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...