./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 870ae97b49a86bb76d7faef1a4b6153ee575bfcf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-96f1638 [2020-12-02 11:57:53,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:57:53,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:57:53,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:57:53,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:57:53,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:57:53,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:57:53,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:57:53,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:57:53,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:57:53,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:57:53,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:57:53,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:57:53,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:57:53,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:57:53,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:57:53,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:57:53,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:57:53,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:57:53,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:57:53,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:57:53,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:57:53,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:57:53,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:57:53,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:57:53,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:57:53,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:57:53,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:57:53,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:57:53,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:57:53,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:57:53,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:57:53,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:57:53,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:57:53,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:57:53,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:57:53,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:57:53,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:57:53,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:57:53,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:57:53,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:57:53,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 11:57:53,977 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:57:53,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:57:53,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:57:53,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:57:53,979 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:57:53,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:57:53,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:57:53,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:57:53,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:57:53,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:57:53,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:57:53,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:57:53,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:57:53,981 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:57:53,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:57:53,981 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:57:53,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:57:53,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:57:53,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:57:53,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:57:53,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:57:53,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:57:53,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:57:53,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:57:53,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:57:53,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:57:53,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:57:53,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:57:53,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:57:53,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 870ae97b49a86bb76d7faef1a4b6153ee575bfcf [2020-12-02 11:57:54,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:57:54,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:57:54,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:57:54,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:57:54,437 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:57:54,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i [2020-12-02 11:57:54,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f4e9bd6/e4c15a608106493997d092432eb5e93a/FLAG6aba2bf8c [2020-12-02 11:57:55,374 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:57:55,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i [2020-12-02 11:57:55,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f4e9bd6/e4c15a608106493997d092432eb5e93a/FLAG6aba2bf8c [2020-12-02 11:57:55,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f4e9bd6/e4c15a608106493997d092432eb5e93a [2020-12-02 11:57:55,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:57:55,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:57:55,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:57:55,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:57:55,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:57:55,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:57:55" (1/1) ... [2020-12-02 11:57:55,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1887045d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:55, skipping insertion in model container [2020-12-02 11:57:55,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:57:55" (1/1) ... [2020-12-02 11:57:55,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:57:55,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:57:55,694 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i[949,962] [2020-12-02 11:57:56,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:57:56,029 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:57:56,046 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_rmo.oepc.i[949,962] [2020-12-02 11:57:56,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:57:56,255 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:57:56,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56 WrapperNode [2020-12-02 11:57:56,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:57:56,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:57:56,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:57:56,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:57:56,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:57:56,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:57:56,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:57:56,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:57:56,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... [2020-12-02 11:57:56,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:57:56,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:57:56,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:57:56,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:57:56,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:57:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:57:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:57:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:57:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:57:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:57:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:57:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:57:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:57:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 11:57:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 11:57:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:57:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:57:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:57:56,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:57:56,554 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 11:57:58,934 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:57:58,934 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:57:58,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:57:58 BoogieIcfgContainer [2020-12-02 11:57:58,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:57:58,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:57:58,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:57:58,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:57:58,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:57:55" (1/3) ... [2020-12-02 11:57:58,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ea9217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:57:58, skipping insertion in model container [2020-12-02 11:57:58,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:57:56" (2/3) ... [2020-12-02 11:57:58,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ea9217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:57:58, skipping insertion in model container [2020-12-02 11:57:58,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:57:58" (3/3) ... [2020-12-02 11:57:58,946 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.oepc.i [2020-12-02 11:57:58,963 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:57:58,963 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:57:58,967 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:57:58,968 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:57:59,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,008 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,008 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,010 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,010 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,035 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:57:59,086 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:57:59,101 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 11:57:59,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:57:59,144 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:57:59,144 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:57:59,145 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:57:59,145 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:57:59,145 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:57:59,145 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:57:59,146 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:57:59,164 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:57:59,167 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2020-12-02 11:57:59,171 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 217 flow [2020-12-02 11:57:59,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-12-02 11:57:59,249 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-12-02 11:57:59,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:57:59,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-12-02 11:57:59,276 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-12-02 11:57:59,498 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-12-02 11:58:00,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:00,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:00,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:00,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:00,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:00,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:00,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:00,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:00,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:01,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:01,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:01,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:58:01,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:02,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:58:02,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:02,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:02,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:02,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:02,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:58:02,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:58:02,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:58:02,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:58:02,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:58:02,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:58:02,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:03,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:03,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:03,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:03,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:03,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:03,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:58:03,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:03,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:58:03,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:58:04,596 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-12-02 11:58:04,803 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-12-02 11:58:05,808 WARN L197 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-02 11:58:06,042 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-02 11:58:06,539 WARN L197 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-02 11:58:06,772 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-02 11:58:06,779 INFO L131 LiptonReduction]: Checked pairs total: 4940 [2020-12-02 11:58:06,780 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-12-02 11:58:06,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-02 11:58:06,876 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1154 states. [2020-12-02 11:58:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states. [2020-12-02 11:58:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-02 11:58:06,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:06,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-02 11:58:06,886 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1071709, now seen corresponding path program 1 times [2020-12-02 11:58:06,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:06,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753538801] [2020-12-02 11:58:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:07,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753538801] [2020-12-02 11:58:07,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:07,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:58:07,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124454373] [2020-12-02 11:58:07,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:07,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:07,184 INFO L87 Difference]: Start difference. First operand 1154 states. Second operand 3 states. [2020-12-02 11:58:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:07,307 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-12-02 11:58:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:07,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-02 11:58:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:07,355 INFO L225 Difference]: With dead ends: 962 [2020-12-02 11:58:07,356 INFO L226 Difference]: Without dead ends: 812 [2020-12-02 11:58:07,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-02 11:58:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-12-02 11:58:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-12-02 11:58:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-12-02 11:58:07,496 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2020-12-02 11:58:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:07,497 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-12-02 11:58:07,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-12-02 11:58:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 11:58:07,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:07,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:07,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:58:07,501 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1320709069, now seen corresponding path program 1 times [2020-12-02 11:58:07,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:07,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591557746] [2020-12-02 11:58:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:07,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591557746] [2020-12-02 11:58:07,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:07,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:07,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643251290] [2020-12-02 11:58:07,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:07,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:07,702 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-12-02 11:58:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:07,807 INFO L93 Difference]: Finished difference Result 1606 states and 4867 transitions. [2020-12-02 11:58:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:07,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 11:58:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:07,818 INFO L225 Difference]: With dead ends: 1606 [2020-12-02 11:58:07,818 INFO L226 Difference]: Without dead ends: 1186 [2020-12-02 11:58:07,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-12-02 11:58:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 970. [2020-12-02 11:58:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-12-02 11:58:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2970 transitions. [2020-12-02 11:58:07,929 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2970 transitions. Word has length 10 [2020-12-02 11:58:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:07,932 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 2970 transitions. [2020-12-02 11:58:07,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2970 transitions. [2020-12-02 11:58:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 11:58:07,936 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:07,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:07,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:58:07,937 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1944623346, now seen corresponding path program 1 times [2020-12-02 11:58:07,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:07,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260443346] [2020-12-02 11:58:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:08,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260443346] [2020-12-02 11:58:08,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:08,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:08,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363879610] [2020-12-02 11:58:08,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:08,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:08,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:08,064 INFO L87 Difference]: Start difference. First operand 970 states and 2970 transitions. Second operand 4 states. [2020-12-02 11:58:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:08,094 INFO L93 Difference]: Finished difference Result 1025 states and 3044 transitions. [2020-12-02 11:58:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:08,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 11:58:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:08,116 INFO L225 Difference]: With dead ends: 1025 [2020-12-02 11:58:08,117 INFO L226 Difference]: Without dead ends: 880 [2020-12-02 11:58:08,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-02 11:58:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 802. [2020-12-02 11:58:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-12-02 11:58:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2416 transitions. [2020-12-02 11:58:08,151 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2416 transitions. Word has length 11 [2020-12-02 11:58:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:08,151 INFO L481 AbstractCegarLoop]: Abstraction has 802 states and 2416 transitions. [2020-12-02 11:58:08,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2416 transitions. [2020-12-02 11:58:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 11:58:08,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:08,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:08,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:58:08,155 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 635791607, now seen corresponding path program 1 times [2020-12-02 11:58:08,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:08,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89942147] [2020-12-02 11:58:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:08,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89942147] [2020-12-02 11:58:08,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:08,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:08,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088535216] [2020-12-02 11:58:08,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:08,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:08,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:08,241 INFO L87 Difference]: Start difference. First operand 802 states and 2416 transitions. Second operand 4 states. [2020-12-02 11:58:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:08,277 INFO L93 Difference]: Finished difference Result 886 states and 2599 transitions. [2020-12-02 11:58:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:08,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 11:58:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:08,285 INFO L225 Difference]: With dead ends: 886 [2020-12-02 11:58:08,285 INFO L226 Difference]: Without dead ends: 786 [2020-12-02 11:58:08,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-12-02 11:58:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2020-12-02 11:58:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-12-02 11:58:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2356 transitions. [2020-12-02 11:58:08,317 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2356 transitions. Word has length 12 [2020-12-02 11:58:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:08,317 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 2356 transitions. [2020-12-02 11:58:08,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2356 transitions. [2020-12-02 11:58:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 11:58:08,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:08,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:08,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:58:08,320 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1945374446, now seen corresponding path program 1 times [2020-12-02 11:58:08,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:08,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46917750] [2020-12-02 11:58:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:08,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46917750] [2020-12-02 11:58:08,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:08,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 11:58:08,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246499643] [2020-12-02 11:58:08,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:58:08,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:58:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:08,383 INFO L87 Difference]: Start difference. First operand 786 states and 2356 transitions. Second operand 3 states. [2020-12-02 11:58:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:08,396 INFO L93 Difference]: Finished difference Result 510 states and 1280 transitions. [2020-12-02 11:58:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:58:08,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-02 11:58:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:08,400 INFO L225 Difference]: With dead ends: 510 [2020-12-02 11:58:08,400 INFO L226 Difference]: Without dead ends: 510 [2020-12-02 11:58:08,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:58:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-02 11:58:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-12-02 11:58:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-12-02 11:58:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1280 transitions. [2020-12-02 11:58:08,418 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1280 transitions. Word has length 13 [2020-12-02 11:58:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:08,418 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1280 transitions. [2020-12-02 11:58:08,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:58:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1280 transitions. [2020-12-02 11:58:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:58:08,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:08,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:08,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:58:08,420 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash -723511528, now seen corresponding path program 1 times [2020-12-02 11:58:08,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:08,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196631594] [2020-12-02 11:58:08,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:08,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196631594] [2020-12-02 11:58:08,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:08,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:58:08,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108463098] [2020-12-02 11:58:08,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:58:08,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:58:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:08,494 INFO L87 Difference]: Start difference. First operand 510 states and 1280 transitions. Second operand 4 states. [2020-12-02 11:58:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:08,515 INFO L93 Difference]: Finished difference Result 298 states and 666 transitions. [2020-12-02 11:58:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 11:58:08,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-02 11:58:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:08,518 INFO L225 Difference]: With dead ends: 298 [2020-12-02 11:58:08,518 INFO L226 Difference]: Without dead ends: 292 [2020-12-02 11:58:08,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:58:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-02 11:58:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 280. [2020-12-02 11:58:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-02 11:58:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 619 transitions. [2020-12-02 11:58:08,527 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 619 transitions. Word has length 16 [2020-12-02 11:58:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:08,527 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 619 transitions. [2020-12-02 11:58:08,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:58:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 619 transitions. [2020-12-02 11:58:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 11:58:08,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:08,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:08,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:58:08,529 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash 814820445, now seen corresponding path program 1 times [2020-12-02 11:58:08,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:08,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462293311] [2020-12-02 11:58:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:08,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462293311] [2020-12-02 11:58:08,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:08,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:08,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31493955] [2020-12-02 11:58:08,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:08,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:08,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:08,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:08,706 INFO L87 Difference]: Start difference. First operand 280 states and 619 transitions. Second operand 5 states. [2020-12-02 11:58:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:08,759 INFO L93 Difference]: Finished difference Result 228 states and 519 transitions. [2020-12-02 11:58:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:08,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-02 11:58:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:08,762 INFO L225 Difference]: With dead ends: 228 [2020-12-02 11:58:08,762 INFO L226 Difference]: Without dead ends: 177 [2020-12-02 11:58:08,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-02 11:58:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2020-12-02 11:58:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-02 11:58:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 387 transitions. [2020-12-02 11:58:08,769 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 387 transitions. Word has length 19 [2020-12-02 11:58:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:08,769 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 387 transitions. [2020-12-02 11:58:08,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 387 transitions. [2020-12-02 11:58:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:58:08,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:08,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:08,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 11:58:08,771 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1148189960, now seen corresponding path program 1 times [2020-12-02 11:58:08,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:08,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361480128] [2020-12-02 11:58:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:09,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361480128] [2020-12-02 11:58:09,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:09,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:09,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529972202] [2020-12-02 11:58:09,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:09,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:09,051 INFO L87 Difference]: Start difference. First operand 168 states and 387 transitions. Second operand 5 states. [2020-12-02 11:58:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:09,108 INFO L93 Difference]: Finished difference Result 288 states and 654 transitions. [2020-12-02 11:58:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:09,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-02 11:58:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:09,110 INFO L225 Difference]: With dead ends: 288 [2020-12-02 11:58:09,110 INFO L226 Difference]: Without dead ends: 146 [2020-12-02 11:58:09,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-02 11:58:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2020-12-02 11:58:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-02 11:58:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 275 transitions. [2020-12-02 11:58:09,120 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 275 transitions. Word has length 23 [2020-12-02 11:58:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:09,120 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 275 transitions. [2020-12-02 11:58:09,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 275 transitions. [2020-12-02 11:58:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:58:09,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:09,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:09,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 11:58:09,122 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:09,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:09,122 INFO L82 PathProgramCache]: Analyzing trace with hash 764081412, now seen corresponding path program 2 times [2020-12-02 11:58:09,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:09,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761365586] [2020-12-02 11:58:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:58:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:58:09,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761365586] [2020-12-02 11:58:09,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:58:09,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:58:09,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88096353] [2020-12-02 11:58:09,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:58:09,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:58:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:58:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:58:09,334 INFO L87 Difference]: Start difference. First operand 128 states and 275 transitions. Second operand 5 states. [2020-12-02 11:58:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:58:09,376 INFO L93 Difference]: Finished difference Result 182 states and 387 transitions. [2020-12-02 11:58:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:58:09,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-02 11:58:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:58:09,378 INFO L225 Difference]: With dead ends: 182 [2020-12-02 11:58:09,378 INFO L226 Difference]: Without dead ends: 112 [2020-12-02 11:58:09,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:58:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-02 11:58:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-02 11:58:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-02 11:58:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 235 transitions. [2020-12-02 11:58:09,384 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 235 transitions. Word has length 23 [2020-12-02 11:58:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:58:09,384 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 235 transitions. [2020-12-02 11:58:09,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:58:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 235 transitions. [2020-12-02 11:58:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 11:58:09,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:58:09,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:58:09,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 11:58:09,385 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:58:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:58:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash 984841766, now seen corresponding path program 3 times [2020-12-02 11:58:09,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:58:09,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375034867] [2020-12-02 11:58:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:58:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:58:09,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:58:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:58:09,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:58:09,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:58:09,696 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:58:09,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 11:58:09,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:58:09 BasicIcfg [2020-12-02 11:58:09,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:58:09,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:58:09,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:58:09,850 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:58:09,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:57:58" (3/4) ... [2020-12-02 11:58:09,853 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:58:10,067 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:58:10,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:58:10,069 INFO L168 Benchmark]: Toolchain (without parser) took 14637.32 ms. Allocated memory was 46.1 MB in the beginning and 251.7 MB in the end (delta: 205.5 MB). Free memory was 30.0 MB in the beginning and 196.4 MB in the end (delta: -166.3 MB). Peak memory consumption was 40.4 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,069 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory was 28.8 MB in the beginning and 28.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:58:10,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.15 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 29.9 MB in the beginning and 27.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.65 ms. Allocated memory is still 56.6 MB. Free memory was 27.8 MB in the beginning and 25.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,071 INFO L168 Benchmark]: Boogie Preprocessor took 49.04 ms. Allocated memory is still 56.6 MB. Free memory was 25.2 MB in the beginning and 36.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,071 INFO L168 Benchmark]: RCFGBuilder took 2531.46 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 36.7 MB in the beginning and 33.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,072 INFO L168 Benchmark]: TraceAbstraction took 10911.09 ms. Allocated memory was 86.0 MB in the beginning and 251.7 MB in the end (delta: 165.7 MB). Free memory was 32.4 MB in the beginning and 214.2 MB in the end (delta: -181.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,072 INFO L168 Benchmark]: Witness Printer took 217.43 ms. Allocated memory is still 251.7 MB. Free memory was 214.2 MB in the beginning and 196.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-02 11:58:10,075 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.30 ms. Allocated memory is still 46.1 MB. Free memory was 28.8 MB in the beginning and 28.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 822.15 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 29.9 MB in the beginning and 27.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.65 ms. Allocated memory is still 56.6 MB. Free memory was 27.8 MB in the beginning and 25.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.04 ms. Allocated memory is still 56.6 MB. Free memory was 25.2 MB in the beginning and 36.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2531.46 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 36.7 MB in the beginning and 33.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10911.09 ms. Allocated memory was 86.0 MB in the beginning and 251.7 MB in the end (delta: 165.7 MB). Free memory was 32.4 MB in the beginning and 214.2 MB in the end (delta: -181.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 16.1 GB. * Witness Printer took 217.43 ms. Allocated memory is still 251.7 MB. Free memory was 214.2 MB in the beginning and 196.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1342 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 216 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.6s, 109 PlacesBefore, 38 PlacesAfterwards, 101 TransitionsBefore, 29 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 4940 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1205; [L842] FCALL, FORK 0 pthread_create(&t1205, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1206; [L844] FCALL, FORK 0 pthread_create(&t1206, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1207; [L846] FCALL, FORK 0 pthread_create(&t1207, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L808] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L808] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L810] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L810] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L812] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L819] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L852] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L852] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L852] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 255 SDtfs, 214 SDslu, 363 SDs, 0 SdLazy, 103 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 333 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 10999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...