./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5779294efb07ac4ab2a10e97d71dcf7333b3f83a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.25-f470102 [2019-12-07 14:43:47,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:43:47,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:43:47,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:43:47,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:43:47,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:43:47,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:43:47,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:43:47,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:43:47,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:43:47,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:43:47,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:43:47,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:43:47,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:43:47,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:43:47,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:43:47,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:43:47,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:43:47,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:43:47,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:43:47,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:43:47,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:43:47,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:43:47,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:43:47,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:43:47,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:43:47,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:43:47,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:43:47,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:43:47,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:43:47,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:43:47,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:43:47,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:43:47,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:43:47,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:43:47,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:43:47,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:43:47,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:43:47,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:43:47,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:43:47,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:43:47,973 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:43:47,984 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:43:47,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:43:47,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:43:47,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:43:47,985 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:43:47,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:43:47,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:43:47,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:43:47,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:43:47,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:43:47,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:43:47,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 5779294efb07ac4ab2a10e97d71dcf7333b3f83a [2019-12-07 14:43:48,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:43:48,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:43:48,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:43:48,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:43:48,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:43:48,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix001_power.opt.i [2019-12-07 14:43:48,145 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/data/4fe5134e6/144da4c1a338485684dd2b1343b6a2fb/FLAGce3fd689f [2019-12-07 14:43:48,629 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:43:48,630 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/sv-benchmarks/c/pthread-wmm/mix001_power.opt.i [2019-12-07 14:43:48,641 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/data/4fe5134e6/144da4c1a338485684dd2b1343b6a2fb/FLAGce3fd689f [2019-12-07 14:43:48,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/data/4fe5134e6/144da4c1a338485684dd2b1343b6a2fb [2019-12-07 14:43:48,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:43:48,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:43:48,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:43:48,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:43:48,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:43:48,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:43:48" (1/1) ... [2019-12-07 14:43:48,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:48, skipping insertion in model container [2019-12-07 14:43:48,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:43:48" (1/1) ... [2019-12-07 14:43:48,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:43:48,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:43:48,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:43:48,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:43:49,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:43:49,049 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:43:49,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49 WrapperNode [2019-12-07 14:43:49,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:43:49,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:43:49,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:43:49,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:43:49,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:43:49,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:43:49,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:43:49,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:43:49,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... [2019-12-07 14:43:49,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:43:49,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:43:49,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:43:49,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:43:49,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:43:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:43:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:43:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:43:49,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:43:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:43:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:43:49,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:43:49,166 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:43:49,567 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:43:49,567 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:43:49,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:43:49 BoogieIcfgContainer [2019-12-07 14:43:49,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:43:49,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:43:49,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:43:49,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:43:49,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:43:48" (1/3) ... [2019-12-07 14:43:49,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f04e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:43:49, skipping insertion in model container [2019-12-07 14:43:49,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:43:49" (2/3) ... [2019-12-07 14:43:49,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f04e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:43:49, skipping insertion in model container [2019-12-07 14:43:49,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:43:49" (3/3) ... [2019-12-07 14:43:49,573 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2019-12-07 14:43:49,579 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:43:49,579 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:43:49,584 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:43:49,584 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:43:49,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:43:49,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:43:49,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:43:49,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:43:49,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:43:49,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:43:49,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:43:49,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:43:49,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:43:49,672 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 14:43:49,673 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 14:43:49,734 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 14:43:49,735 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:43:49,746 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:43:49,769 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 14:43:49,803 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 14:43:49,803 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:43:49,810 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 14:43:49,834 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 14:43:49,835 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:43:53,230 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 14:43:53,633 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 14:43:53,751 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-07 14:43:53,751 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 14:43:53,753 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 14:43:56,557 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 14:43:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 14:43:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:43:56,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:56,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:56,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-07 14:43:56,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:43:56,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645250012] [2019-12-07 14:43:56,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:43:56,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645250012] [2019-12-07 14:43:56,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:56,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:43:56,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984085538] [2019-12-07 14:43:56,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:43:56,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:43:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:43:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:43:56,734 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 14:43:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:57,161 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 14:43:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:43:57,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 14:43:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:57,418 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 14:43:57,418 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 14:43:57,419 INFO L630 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 [2019-12-07 14:43:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 14:43:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 14:43:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 14:43:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 14:43:58,941 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 14:43:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:58,942 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 14:43:58,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:43:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 14:43:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:43:58,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:58,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:58,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-07 14:43:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:43:58,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716115206] [2019-12-07 14:43:58,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:43:59,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716115206] [2019-12-07 14:43:59,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:59,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:43:59,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205613968] [2019-12-07 14:43:59,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:43:59,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:43:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:43:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:43:59,004 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 14:43:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:59,462 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 14:43:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:43:59,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:43:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:59,688 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 14:43:59,689 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 14:43:59,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 14:44:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 14:44:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 14:44:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 14:44:01,506 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 14:44:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:01,507 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 14:44:01,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 14:44:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:44:01,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:01,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:01,512 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-07 14:44:01,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:01,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347988168] [2019-12-07 14:44:01,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347988168] [2019-12-07 14:44:01,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:01,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:01,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779053039] [2019-12-07 14:44:01,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:44:01,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:44:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:44:01,565 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 14:44:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:02,005 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 14:44:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:44:02,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 14:44:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:02,179 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 14:44:02,179 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 14:44:02,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 14:44:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 14:44:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 14:44:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 14:44:05,127 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 14:44:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:05,128 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 14:44:05,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 14:44:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:44:05,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:05,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:05,134 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-07 14:44:05,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:05,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632879112] [2019-12-07 14:44:05,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:05,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632879112] [2019-12-07 14:44:05,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:05,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:44:05,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967387872] [2019-12-07 14:44:05,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:05,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:05,178 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 14:44:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:05,423 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-07 14:44:05,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:05,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:44:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:05,571 INFO L225 Difference]: With dead ends: 68874 [2019-12-07 14:44:05,571 INFO L226 Difference]: Without dead ends: 68874 [2019-12-07 14:44:05,571 INFO L630 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 [2019-12-07 14:44:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-07 14:44:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-07 14:44:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-07 14:44:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-07 14:44:07,381 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-07 14:44:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:07,381 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-07 14:44:07,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-07 14:44:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:44:07,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:07,396 INFO L410 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] [2019-12-07 14:44:07,396 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-07 14:44:07,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:07,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905827242] [2019-12-07 14:44:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:07,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905827242] [2019-12-07 14:44:07,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:07,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:44:07,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997738053] [2019-12-07 14:44:07,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:07,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:07,441 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-07 14:44:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:08,094 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-07 14:44:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:44:08,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 14:44:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:08,267 INFO L225 Difference]: With dead ends: 81922 [2019-12-07 14:44:08,268 INFO L226 Difference]: Without dead ends: 81870 [2019-12-07 14:44:08,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:44:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-07 14:44:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-07 14:44:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-07 14:44:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-07 14:44:10,131 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-07 14:44:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:10,132 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-07 14:44:10,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-07 14:44:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 14:44:10,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:10,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:10,196 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-07 14:44:10,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:10,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85828883] [2019-12-07 14:44:10,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:10,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85828883] [2019-12-07 14:44:10,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:10,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:10,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299259117] [2019-12-07 14:44:10,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:10,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:10,248 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 3 states. [2019-12-07 14:44:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:10,500 INFO L93 Difference]: Finished difference Result 68462 states and 266022 transitions. [2019-12-07 14:44:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:10,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 14:44:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:10,643 INFO L225 Difference]: With dead ends: 68462 [2019-12-07 14:44:10,643 INFO L226 Difference]: Without dead ends: 68462 [2019-12-07 14:44:10,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68462 states. [2019-12-07 14:44:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68462 to 68302. [2019-12-07 14:44:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68302 states. [2019-12-07 14:44:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68302 states to 68302 states and 265518 transitions. [2019-12-07 14:44:12,362 INFO L78 Accepts]: Start accepts. Automaton has 68302 states and 265518 transitions. Word has length 32 [2019-12-07 14:44:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:12,362 INFO L462 AbstractCegarLoop]: Abstraction has 68302 states and 265518 transitions. [2019-12-07 14:44:12,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 68302 states and 265518 transitions. [2019-12-07 14:44:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:44:12,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:12,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:12,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 325215007, now seen corresponding path program 1 times [2019-12-07 14:44:12,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:12,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375824927] [2019-12-07 14:44:12,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:12,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375824927] [2019-12-07 14:44:12,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:12,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:12,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812683648] [2019-12-07 14:44:12,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:44:12,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:12,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:44:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:44:12,481 INFO L87 Difference]: Start difference. First operand 68302 states and 265518 transitions. Second operand 4 states. [2019-12-07 14:44:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:12,752 INFO L93 Difference]: Finished difference Result 68250 states and 265338 transitions. [2019-12-07 14:44:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:12,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 14:44:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:12,895 INFO L225 Difference]: With dead ends: 68250 [2019-12-07 14:44:12,896 INFO L226 Difference]: Without dead ends: 68250 [2019-12-07 14:44:12,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:44:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68250 states. [2019-12-07 14:44:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68250 to 68250. [2019-12-07 14:44:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68250 states. [2019-12-07 14:44:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68250 states to 68250 states and 265338 transitions. [2019-12-07 14:44:14,656 INFO L78 Accepts]: Start accepts. Automaton has 68250 states and 265338 transitions. Word has length 33 [2019-12-07 14:44:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:14,656 INFO L462 AbstractCegarLoop]: Abstraction has 68250 states and 265338 transitions. [2019-12-07 14:44:14,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 68250 states and 265338 transitions. [2019-12-07 14:44:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:44:14,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:14,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:14,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1480995424, now seen corresponding path program 1 times [2019-12-07 14:44:14,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:14,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181823500] [2019-12-07 14:44:14,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:14,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181823500] [2019-12-07 14:44:14,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:14,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:44:14,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637750419] [2019-12-07 14:44:14,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:14,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:14,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:14,779 INFO L87 Difference]: Start difference. First operand 68250 states and 265338 transitions. Second operand 5 states. [2019-12-07 14:44:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:15,245 INFO L93 Difference]: Finished difference Result 95248 states and 375740 transitions. [2019-12-07 14:44:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:44:15,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 14:44:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:15,455 INFO L225 Difference]: With dead ends: 95248 [2019-12-07 14:44:15,456 INFO L226 Difference]: Without dead ends: 95248 [2019-12-07 14:44:15,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:44:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95248 states. [2019-12-07 14:44:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95248 to 92642. [2019-12-07 14:44:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92642 states. [2019-12-07 14:44:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92642 states to 92642 states and 366378 transitions. [2019-12-07 14:44:17,841 INFO L78 Accepts]: Start accepts. Automaton has 92642 states and 366378 transitions. Word has length 34 [2019-12-07 14:44:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:17,841 INFO L462 AbstractCegarLoop]: Abstraction has 92642 states and 366378 transitions. [2019-12-07 14:44:17,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92642 states and 366378 transitions. [2019-12-07 14:44:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:44:17,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:17,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:17,929 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1405115850, now seen corresponding path program 2 times [2019-12-07 14:44:17,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:17,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511861367] [2019-12-07 14:44:17,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:17,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511861367] [2019-12-07 14:44:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:44:17,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962980557] [2019-12-07 14:44:17,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:17,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:17,966 INFO L87 Difference]: Start difference. First operand 92642 states and 366378 transitions. Second operand 3 states. [2019-12-07 14:44:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:18,305 INFO L93 Difference]: Finished difference Result 91848 states and 363009 transitions. [2019-12-07 14:44:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:18,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 14:44:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:18,503 INFO L225 Difference]: With dead ends: 91848 [2019-12-07 14:44:18,504 INFO L226 Difference]: Without dead ends: 91848 [2019-12-07 14:44:18,504 INFO L630 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 [2019-12-07 14:44:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91848 states. [2019-12-07 14:44:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91848 to 91056. [2019-12-07 14:44:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91056 states. [2019-12-07 14:44:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91056 states to 91056 states and 359643 transitions. [2019-12-07 14:44:22,311 INFO L78 Accepts]: Start accepts. Automaton has 91056 states and 359643 transitions. Word has length 34 [2019-12-07 14:44:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:22,311 INFO L462 AbstractCegarLoop]: Abstraction has 91056 states and 359643 transitions. [2019-12-07 14:44:22,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 91056 states and 359643 transitions. [2019-12-07 14:44:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:22,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:22,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:22,400 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-07 14:44:22,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:22,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450429229] [2019-12-07 14:44:22,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:22,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450429229] [2019-12-07 14:44:22,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:22,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279993854] [2019-12-07 14:44:22,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:44:22,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:22,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:44:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:44:22,446 INFO L87 Difference]: Start difference. First operand 91056 states and 359643 transitions. Second operand 6 states. [2019-12-07 14:44:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:23,102 INFO L93 Difference]: Finished difference Result 147305 states and 576516 transitions. [2019-12-07 14:44:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:44:23,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 14:44:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:23,418 INFO L225 Difference]: With dead ends: 147305 [2019-12-07 14:44:23,418 INFO L226 Difference]: Without dead ends: 135405 [2019-12-07 14:44:23,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:44:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135405 states. [2019-12-07 14:44:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135405 to 117080. [2019-12-07 14:44:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117080 states. [2019-12-07 14:44:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117080 states to 117080 states and 464603 transitions. [2019-12-07 14:44:26,546 INFO L78 Accepts]: Start accepts. Automaton has 117080 states and 464603 transitions. Word has length 35 [2019-12-07 14:44:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:26,546 INFO L462 AbstractCegarLoop]: Abstraction has 117080 states and 464603 transitions. [2019-12-07 14:44:26,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:44:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 117080 states and 464603 transitions. [2019-12-07 14:44:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:26,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:26,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:26,663 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 2 times [2019-12-07 14:44:26,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:26,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161269636] [2019-12-07 14:44:26,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:26,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161269636] [2019-12-07 14:44:26,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:26,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:44:26,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387465058] [2019-12-07 14:44:26,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:44:26,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:44:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:44:26,819 INFO L87 Difference]: Start difference. First operand 117080 states and 464603 transitions. Second operand 12 states. [2019-12-07 14:44:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:28,499 INFO L93 Difference]: Finished difference Result 165489 states and 651679 transitions. [2019-12-07 14:44:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:44:28,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-07 14:44:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:28,876 INFO L225 Difference]: With dead ends: 165489 [2019-12-07 14:44:28,876 INFO L226 Difference]: Without dead ends: 165489 [2019-12-07 14:44:28,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:44:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165489 states. [2019-12-07 14:44:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165489 to 116438. [2019-12-07 14:44:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116438 states. [2019-12-07 14:44:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116438 states to 116438 states and 461212 transitions. [2019-12-07 14:44:32,155 INFO L78 Accepts]: Start accepts. Automaton has 116438 states and 461212 transitions. Word has length 35 [2019-12-07 14:44:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:32,155 INFO L462 AbstractCegarLoop]: Abstraction has 116438 states and 461212 transitions. [2019-12-07 14:44:32,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:44:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 116438 states and 461212 transitions. [2019-12-07 14:44:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:32,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:32,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:32,273 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2057692010, now seen corresponding path program 3 times [2019-12-07 14:44:32,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:32,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853168603] [2019-12-07 14:44:32,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:32,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853168603] [2019-12-07 14:44:32,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:32,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:44:32,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543773488] [2019-12-07 14:44:32,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:44:32,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:44:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:44:32,325 INFO L87 Difference]: Start difference. First operand 116438 states and 461212 transitions. Second operand 7 states. [2019-12-07 14:44:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:33,189 INFO L93 Difference]: Finished difference Result 184853 states and 721355 transitions. [2019-12-07 14:44:33,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:44:33,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 14:44:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:33,566 INFO L225 Difference]: With dead ends: 184853 [2019-12-07 14:44:33,566 INFO L226 Difference]: Without dead ends: 162773 [2019-12-07 14:44:33,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:44:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162773 states. [2019-12-07 14:44:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162773 to 112886. [2019-12-07 14:44:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112886 states. [2019-12-07 14:44:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112886 states to 112886 states and 442888 transitions. [2019-12-07 14:44:36,817 INFO L78 Accepts]: Start accepts. Automaton has 112886 states and 442888 transitions. Word has length 35 [2019-12-07 14:44:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:36,817 INFO L462 AbstractCegarLoop]: Abstraction has 112886 states and 442888 transitions. [2019-12-07 14:44:36,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:44:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 112886 states and 442888 transitions. [2019-12-07 14:44:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:36,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:36,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:36,939 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:36,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1411267042, now seen corresponding path program 4 times [2019-12-07 14:44:36,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:36,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497905813] [2019-12-07 14:44:36,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:37,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497905813] [2019-12-07 14:44:37,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:37,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:44:37,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119688726] [2019-12-07 14:44:37,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:44:37,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:44:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:44:37,056 INFO L87 Difference]: Start difference. First operand 112886 states and 442888 transitions. Second operand 7 states. [2019-12-07 14:44:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:37,953 INFO L93 Difference]: Finished difference Result 160808 states and 636614 transitions. [2019-12-07 14:44:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:44:37,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 14:44:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:38,325 INFO L225 Difference]: With dead ends: 160808 [2019-12-07 14:44:38,325 INFO L226 Difference]: Without dead ends: 160808 [2019-12-07 14:44:38,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:44:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160808 states. [2019-12-07 14:44:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160808 to 132064. [2019-12-07 14:44:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132064 states. [2019-12-07 14:44:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132064 states to 132064 states and 522141 transitions. [2019-12-07 14:44:41,571 INFO L78 Accepts]: Start accepts. Automaton has 132064 states and 522141 transitions. Word has length 35 [2019-12-07 14:44:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:41,571 INFO L462 AbstractCegarLoop]: Abstraction has 132064 states and 522141 transitions. [2019-12-07 14:44:41,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:44:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 132064 states and 522141 transitions. [2019-12-07 14:44:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:41,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:41,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:41,717 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2011599710, now seen corresponding path program 5 times [2019-12-07 14:44:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:41,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289521705] [2019-12-07 14:44:41,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:41,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289521705] [2019-12-07 14:44:41,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:44:41,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184277988] [2019-12-07 14:44:41,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:44:41,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:44:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:44:41,800 INFO L87 Difference]: Start difference. First operand 132064 states and 522141 transitions. Second operand 8 states. [2019-12-07 14:44:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:43,295 INFO L93 Difference]: Finished difference Result 204301 states and 809379 transitions. [2019-12-07 14:44:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:44:43,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 14:44:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:43,812 INFO L225 Difference]: With dead ends: 204301 [2019-12-07 14:44:43,812 INFO L226 Difference]: Without dead ends: 204301 [2019-12-07 14:44:43,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:44:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204301 states. [2019-12-07 14:44:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204301 to 132166. [2019-12-07 14:44:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132166 states. [2019-12-07 14:44:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132166 states to 132166 states and 522504 transitions. [2019-12-07 14:44:49,116 INFO L78 Accepts]: Start accepts. Automaton has 132166 states and 522504 transitions. Word has length 35 [2019-12-07 14:44:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:49,116 INFO L462 AbstractCegarLoop]: Abstraction has 132166 states and 522504 transitions. [2019-12-07 14:44:49,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:44:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 132166 states and 522504 transitions. [2019-12-07 14:44:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:49,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:49,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:49,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1246317874, now seen corresponding path program 6 times [2019-12-07 14:44:49,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:49,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6246097] [2019-12-07 14:44:49,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:49,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6246097] [2019-12-07 14:44:49,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:49,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:44:49,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867523082] [2019-12-07 14:44:49,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:44:49,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:44:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:44:49,421 INFO L87 Difference]: Start difference. First operand 132166 states and 522504 transitions. Second operand 11 states. [2019-12-07 14:44:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:51,930 INFO L93 Difference]: Finished difference Result 256504 states and 1024978 transitions. [2019-12-07 14:44:51,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 14:44:51,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 14:44:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:52,558 INFO L225 Difference]: With dead ends: 256504 [2019-12-07 14:44:52,558 INFO L226 Difference]: Without dead ends: 256504 [2019-12-07 14:44:52,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:44:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256504 states. [2019-12-07 14:44:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256504 to 135074. [2019-12-07 14:44:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135074 states. [2019-12-07 14:44:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135074 states to 135074 states and 534862 transitions. [2019-12-07 14:44:56,819 INFO L78 Accepts]: Start accepts. Automaton has 135074 states and 534862 transitions. Word has length 35 [2019-12-07 14:44:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:56,819 INFO L462 AbstractCegarLoop]: Abstraction has 135074 states and 534862 transitions. [2019-12-07 14:44:56,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:44:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135074 states and 534862 transitions. [2019-12-07 14:44:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:44:56,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:56,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:56,968 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1916110248, now seen corresponding path program 7 times [2019-12-07 14:44:56,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:44:56,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875993280] [2019-12-07 14:44:56,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:44:57,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875993280] [2019-12-07 14:44:57,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:57,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:44:57,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757362271] [2019-12-07 14:44:57,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:44:57,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:44:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:44:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:44:57,042 INFO L87 Difference]: Start difference. First operand 135074 states and 534862 transitions. Second operand 8 states. [2019-12-07 14:44:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:58,039 INFO L93 Difference]: Finished difference Result 198065 states and 781553 transitions. [2019-12-07 14:44:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:44:58,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 14:44:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:58,889 INFO L225 Difference]: With dead ends: 198065 [2019-12-07 14:44:58,890 INFO L226 Difference]: Without dead ends: 188617 [2019-12-07 14:44:58,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:45:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188617 states. [2019-12-07 14:45:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188617 to 136896. [2019-12-07 14:45:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136896 states. [2019-12-07 14:45:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136896 states to 136896 states and 542781 transitions. [2019-12-07 14:45:04,870 INFO L78 Accepts]: Start accepts. Automaton has 136896 states and 542781 transitions. Word has length 35 [2019-12-07 14:45:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:04,870 INFO L462 AbstractCegarLoop]: Abstraction has 136896 states and 542781 transitions. [2019-12-07 14:45:04,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:45:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136896 states and 542781 transitions. [2019-12-07 14:45:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:45:05,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:05,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:05,028 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash 650797160, now seen corresponding path program 8 times [2019-12-07 14:45:05,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:05,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314969876] [2019-12-07 14:45:05,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:05,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314969876] [2019-12-07 14:45:05,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:05,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:45:05,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513974404] [2019-12-07 14:45:05,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:45:05,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:45:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:45:05,105 INFO L87 Difference]: Start difference. First operand 136896 states and 542781 transitions. Second operand 9 states. [2019-12-07 14:45:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,258 INFO L93 Difference]: Finished difference Result 207537 states and 819977 transitions. [2019-12-07 14:45:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:45:06,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 14:45:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,775 INFO L225 Difference]: With dead ends: 207537 [2019-12-07 14:45:06,775 INFO L226 Difference]: Without dead ends: 198145 [2019-12-07 14:45:06,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:45:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198145 states. [2019-12-07 14:45:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198145 to 133816. [2019-12-07 14:45:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133816 states. [2019-12-07 14:45:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133816 states to 133816 states and 529929 transitions. [2019-12-07 14:45:10,447 INFO L78 Accepts]: Start accepts. Automaton has 133816 states and 529929 transitions. Word has length 35 [2019-12-07 14:45:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:10,448 INFO L462 AbstractCegarLoop]: Abstraction has 133816 states and 529929 transitions. [2019-12-07 14:45:10,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:45:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 133816 states and 529929 transitions. [2019-12-07 14:45:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:45:10,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:10,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:10,596 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1560400136, now seen corresponding path program 9 times [2019-12-07 14:45:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:10,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383968294] [2019-12-07 14:45:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:10,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383968294] [2019-12-07 14:45:10,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:10,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:45:10,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569125138] [2019-12-07 14:45:10,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:45:10,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:45:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:45:10,715 INFO L87 Difference]: Start difference. First operand 133816 states and 529929 transitions. Second operand 9 states. [2019-12-07 14:45:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:12,309 INFO L93 Difference]: Finished difference Result 276567 states and 1081258 transitions. [2019-12-07 14:45:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:45:12,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 14:45:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:12,954 INFO L225 Difference]: With dead ends: 276567 [2019-12-07 14:45:12,954 INFO L226 Difference]: Without dead ends: 266495 [2019-12-07 14:45:12,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:45:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266495 states. [2019-12-07 14:45:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266495 to 114892. [2019-12-07 14:45:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114892 states. [2019-12-07 14:45:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114892 states to 114892 states and 451663 transitions. [2019-12-07 14:45:17,146 INFO L78 Accepts]: Start accepts. Automaton has 114892 states and 451663 transitions. Word has length 35 [2019-12-07 14:45:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:17,146 INFO L462 AbstractCegarLoop]: Abstraction has 114892 states and 451663 transitions. [2019-12-07 14:45:17,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:45:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 114892 states and 451663 transitions. [2019-12-07 14:45:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:45:17,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:17,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:17,278 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1952510451, now seen corresponding path program 1 times [2019-12-07 14:45:17,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:17,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145770153] [2019-12-07 14:45:17,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:17,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145770153] [2019-12-07 14:45:17,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:17,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:45:17,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374936105] [2019-12-07 14:45:17,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:45:17,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:45:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:17,319 INFO L87 Difference]: Start difference. First operand 114892 states and 451663 transitions. Second operand 5 states. [2019-12-07 14:45:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:17,387 INFO L93 Difference]: Finished difference Result 13860 states and 47491 transitions. [2019-12-07 14:45:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:45:17,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 14:45:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:17,397 INFO L225 Difference]: With dead ends: 13860 [2019-12-07 14:45:17,397 INFO L226 Difference]: Without dead ends: 7728 [2019-12-07 14:45:17,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:45:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2019-12-07 14:45:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 7728. [2019-12-07 14:45:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7728 states. [2019-12-07 14:45:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7728 states to 7728 states and 22581 transitions. [2019-12-07 14:45:17,483 INFO L78 Accepts]: Start accepts. Automaton has 7728 states and 22581 transitions. Word has length 36 [2019-12-07 14:45:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:17,484 INFO L462 AbstractCegarLoop]: Abstraction has 7728 states and 22581 transitions. [2019-12-07 14:45:17,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:45:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7728 states and 22581 transitions. [2019-12-07 14:45:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:45:17,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:17,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:17,489 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-07 14:45:17,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:17,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794242752] [2019-12-07 14:45:17,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:17,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794242752] [2019-12-07 14:45:17,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:17,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:45:17,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761929390] [2019-12-07 14:45:17,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:45:17,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:45:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:45:17,617 INFO L87 Difference]: Start difference. First operand 7728 states and 22581 transitions. Second operand 9 states. [2019-12-07 14:45:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:18,171 INFO L93 Difference]: Finished difference Result 11331 states and 31557 transitions. [2019-12-07 14:45:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:45:18,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 14:45:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:18,182 INFO L225 Difference]: With dead ends: 11331 [2019-12-07 14:45:18,182 INFO L226 Difference]: Without dead ends: 11027 [2019-12-07 14:45:18,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:45:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11027 states. [2019-12-07 14:45:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11027 to 8673. [2019-12-07 14:45:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-07 14:45:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 24804 transitions. [2019-12-07 14:45:18,291 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 24804 transitions. Word has length 47 [2019-12-07 14:45:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:18,292 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 24804 transitions. [2019-12-07 14:45:18,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:45:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 24804 transitions. [2019-12-07 14:45:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:45:18,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:18,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:18,299 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1618395182, now seen corresponding path program 2 times [2019-12-07 14:45:18,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:18,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048447988] [2019-12-07 14:45:18,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:18,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048447988] [2019-12-07 14:45:18,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:18,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:45:18,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628926760] [2019-12-07 14:45:18,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:45:18,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:18,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:45:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:45:18,428 INFO L87 Difference]: Start difference. First operand 8673 states and 24804 transitions. Second operand 10 states. [2019-12-07 14:45:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:19,151 INFO L93 Difference]: Finished difference Result 11870 states and 32835 transitions. [2019-12-07 14:45:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:45:19,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-12-07 14:45:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:19,160 INFO L225 Difference]: With dead ends: 11870 [2019-12-07 14:45:19,160 INFO L226 Difference]: Without dead ends: 9605 [2019-12-07 14:45:19,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:45:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2019-12-07 14:45:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 7783. [2019-12-07 14:45:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7783 states. [2019-12-07 14:45:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7783 states to 7783 states and 22658 transitions. [2019-12-07 14:45:19,254 INFO L78 Accepts]: Start accepts. Automaton has 7783 states and 22658 transitions. Word has length 47 [2019-12-07 14:45:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:19,255 INFO L462 AbstractCegarLoop]: Abstraction has 7783 states and 22658 transitions. [2019-12-07 14:45:19,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:45:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7783 states and 22658 transitions. [2019-12-07 14:45:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:45:19,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:19,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:19,261 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 3 times [2019-12-07 14:45:19,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:19,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049304232] [2019-12-07 14:45:19,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:19,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049304232] [2019-12-07 14:45:19,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:19,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:19,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220269216] [2019-12-07 14:45:19,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:45:19,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:45:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:45:19,287 INFO L87 Difference]: Start difference. First operand 7783 states and 22658 transitions. Second operand 4 states. [2019-12-07 14:45:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:19,315 INFO L93 Difference]: Finished difference Result 12027 states and 33225 transitions. [2019-12-07 14:45:19,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:45:19,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 14:45:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:19,319 INFO L225 Difference]: With dead ends: 12027 [2019-12-07 14:45:19,319 INFO L226 Difference]: Without dead ends: 4475 [2019-12-07 14:45:19,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-12-07 14:45:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4475. [2019-12-07 14:45:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2019-12-07 14:45:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 11087 transitions. [2019-12-07 14:45:19,358 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 11087 transitions. Word has length 47 [2019-12-07 14:45:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:19,358 INFO L462 AbstractCegarLoop]: Abstraction has 4475 states and 11087 transitions. [2019-12-07 14:45:19,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:45:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 11087 transitions. [2019-12-07 14:45:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:45:19,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:19,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:19,361 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash 924019022, now seen corresponding path program 4 times [2019-12-07 14:45:19,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:19,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3261580] [2019-12-07 14:45:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3261580] [2019-12-07 14:45:19,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:19,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:45:19,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004385731] [2019-12-07 14:45:19,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:45:19,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:45:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:45:19,409 INFO L87 Difference]: Start difference. First operand 4475 states and 11087 transitions. Second operand 6 states. [2019-12-07 14:45:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:19,448 INFO L93 Difference]: Finished difference Result 3271 states and 8340 transitions. [2019-12-07 14:45:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:45:19,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 14:45:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:19,449 INFO L225 Difference]: With dead ends: 3271 [2019-12-07 14:45:19,449 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 14:45:19,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:45:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 14:45:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 14:45:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 14:45:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 955 transitions. [2019-12-07 14:45:19,453 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 955 transitions. Word has length 47 [2019-12-07 14:45:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:19,453 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 955 transitions. [2019-12-07 14:45:19,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:45:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 955 transitions. [2019-12-07 14:45:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:45:19,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:19,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:19,454 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 1 times [2019-12-07 14:45:19,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:19,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383622757] [2019-12-07 14:45:19,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:19,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383622757] [2019-12-07 14:45:19,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:19,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:45:19,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563390300] [2019-12-07 14:45:19,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:45:19,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:45:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:45:19,526 INFO L87 Difference]: Start difference. First operand 437 states and 955 transitions. Second operand 8 states. [2019-12-07 14:45:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:19,683 INFO L93 Difference]: Finished difference Result 943 states and 2025 transitions. [2019-12-07 14:45:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:45:19,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 14:45:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:19,684 INFO L225 Difference]: With dead ends: 943 [2019-12-07 14:45:19,684 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 14:45:19,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:45:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 14:45:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-07 14:45:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-07 14:45:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1120 transitions. [2019-12-07 14:45:19,689 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1120 transitions. Word has length 63 [2019-12-07 14:45:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:19,690 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1120 transitions. [2019-12-07 14:45:19,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:45:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1120 transitions. [2019-12-07 14:45:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:45:19,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:19,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:19,690 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 2 times [2019-12-07 14:45:19,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:19,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561002662] [2019-12-07 14:45:19,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:45:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:45:19,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:45:19,757 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:45:19,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112|) |v_ULTIMATE.start_main_~#t17~0.offset_63| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_63| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_112| 4)) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_112|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112| 1)) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_59|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_84|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_63|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_112|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:45:19,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-07 14:45:19,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-07 14:45:19,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:45:19,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-837814497 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-837814497 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-837814497| ~y$w_buff0~0_In-837814497) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-837814497| ~y$w_buff1~0_In-837814497) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-837814497, ~y$w_buff1~0=~y$w_buff1~0_In-837814497, ~y$w_buff0~0=~y$w_buff0~0_In-837814497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-837814497} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-837814497|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-837814497, ~y$w_buff1~0=~y$w_buff1~0_In-837814497, ~y$w_buff0~0=~y$w_buff0~0_In-837814497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-837814497} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:45:19,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 14:45:19,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:45:19,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1170666046 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out1170666046| ~y~0_In1170666046) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1170666046| ~y$mem_tmp~0_In1170666046) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1170666046, ~y$flush_delayed~0=~y$flush_delayed~0_In1170666046, ~y~0=~y~0_In1170666046} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1170666046|, ~y$mem_tmp~0=~y$mem_tmp~0_In1170666046, ~y$flush_delayed~0=~y$flush_delayed~0_In1170666046, ~y~0=~y~0_In1170666046} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:45:19,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:45:19,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-109427351 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-109427351 256) 0))) (or (and (= ~y$w_buff0_used~0_In-109427351 |P2Thread1of1ForFork0_#t~ite51_Out-109427351|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-109427351|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109427351, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109427351} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109427351, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109427351, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-109427351|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:45:19,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-277824674 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-277824674 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-277824674 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-277824674 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-277824674| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-277824674| ~y$w_buff1_used~0_In-277824674) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-277824674, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-277824674, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-277824674, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-277824674} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-277824674, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-277824674, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-277824674, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-277824674|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-277824674} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:45:19,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-131189344 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-131189344 256))) (.cse1 (= ~y$r_buff0_thd3~0_Out-131189344 ~y$r_buff0_thd3~0_In-131189344))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-131189344)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-131189344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-131189344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-131189344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-131189344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-131189344|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:45:19,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In689721924 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In689721924 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In689721924 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In689721924 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out689721924|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd3~0_In689721924 |P2Thread1of1ForFork0_#t~ite54_Out689721924|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In689721924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In689721924, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In689721924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In689721924} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In689721924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In689721924, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out689721924|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In689721924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In689721924} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:45:19,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:45:19,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1151893100 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1151893100| ~y$mem_tmp~0_In1151893100) (not .cse0)) (and (= ~y~0_In1151893100 |P1Thread1of1ForFork2_#t~ite25_Out1151893100|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1151893100, ~y$flush_delayed~0=~y$flush_delayed~0_In1151893100, ~y~0=~y~0_In1151893100} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1151893100, ~y$flush_delayed~0=~y$flush_delayed~0_In1151893100, ~y~0=~y~0_In1151893100, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1151893100|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:45:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:45:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:45:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out441718142| |ULTIMATE.start_main_#t~ite58_Out441718142|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In441718142 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In441718142 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In441718142 |ULTIMATE.start_main_#t~ite58_Out441718142|) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out441718142| ~y~0_In441718142) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In441718142, ~y~0=~y~0_In441718142, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In441718142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441718142} OutVars{~y$w_buff1~0=~y$w_buff1~0_In441718142, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out441718142|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out441718142|, ~y~0=~y~0_In441718142, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In441718142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441718142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:45:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1957666284 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1957666284 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1957666284|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1957666284 |ULTIMATE.start_main_#t~ite60_Out-1957666284|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1957666284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1957666284} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1957666284|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1957666284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1957666284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:45:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1019286821 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1019286821 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1019286821 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1019286821 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1019286821| ~y$w_buff1_used~0_In-1019286821) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1019286821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1019286821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1019286821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1019286821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1019286821} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1019286821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1019286821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1019286821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1019286821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1019286821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:45:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1045421140 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1045421140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1045421140| ~y$r_buff0_thd0~0_In-1045421140) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1045421140| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045421140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045421140} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1045421140|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045421140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045421140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:45:19,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In62346324 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In62346324 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In62346324 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In62346324 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out62346324| ~y$r_buff1_thd0~0_In62346324) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out62346324|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In62346324, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In62346324, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In62346324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In62346324} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out62346324|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In62346324, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In62346324, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In62346324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In62346324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:45:19,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:45:19,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:45:19 BasicIcfg [2019-12-07 14:45:19,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:45:19,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:45:19,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:45:19,835 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:45:19,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:43:49" (3/4) ... [2019-12-07 14:45:19,836 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:45:19,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112|) |v_ULTIMATE.start_main_~#t17~0.offset_63| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_63| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_112| 4)) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_112|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112| 1)) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_59|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_84|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_63|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_112|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:45:19,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-07 14:45:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-07 14:45:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:45:19,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-837814497 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-837814497 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-837814497| ~y$w_buff0~0_In-837814497) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-837814497| ~y$w_buff1~0_In-837814497) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-837814497, ~y$w_buff1~0=~y$w_buff1~0_In-837814497, ~y$w_buff0~0=~y$w_buff0~0_In-837814497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-837814497} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-837814497|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-837814497, ~y$w_buff1~0=~y$w_buff1~0_In-837814497, ~y$w_buff0~0=~y$w_buff0~0_In-837814497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-837814497} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:45:19,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 14:45:19,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 14:45:19,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1170666046 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out1170666046| ~y~0_In1170666046) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1170666046| ~y$mem_tmp~0_In1170666046) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1170666046, ~y$flush_delayed~0=~y$flush_delayed~0_In1170666046, ~y~0=~y~0_In1170666046} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1170666046|, ~y$mem_tmp~0=~y$mem_tmp~0_In1170666046, ~y$flush_delayed~0=~y$flush_delayed~0_In1170666046, ~y~0=~y~0_In1170666046} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 14:45:19,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 14:45:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-109427351 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-109427351 256) 0))) (or (and (= ~y$w_buff0_used~0_In-109427351 |P2Thread1of1ForFork0_#t~ite51_Out-109427351|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-109427351|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109427351, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109427351} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109427351, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109427351, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-109427351|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 14:45:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-277824674 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-277824674 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-277824674 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-277824674 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-277824674| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-277824674| ~y$w_buff1_used~0_In-277824674) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-277824674, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-277824674, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-277824674, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-277824674} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-277824674, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-277824674, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-277824674, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-277824674|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-277824674} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 14:45:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-131189344 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-131189344 256))) (.cse1 (= ~y$r_buff0_thd3~0_Out-131189344 ~y$r_buff0_thd3~0_In-131189344))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-131189344)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-131189344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-131189344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-131189344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-131189344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-131189344|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 14:45:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In689721924 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In689721924 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In689721924 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In689721924 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out689721924|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd3~0_In689721924 |P2Thread1of1ForFork0_#t~ite54_Out689721924|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In689721924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In689721924, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In689721924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In689721924} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In689721924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In689721924, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out689721924|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In689721924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In689721924} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:45:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 14:45:19,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1151893100 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1151893100| ~y$mem_tmp~0_In1151893100) (not .cse0)) (and (= ~y~0_In1151893100 |P1Thread1of1ForFork2_#t~ite25_Out1151893100|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1151893100, ~y$flush_delayed~0=~y$flush_delayed~0_In1151893100, ~y~0=~y~0_In1151893100} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1151893100, ~y$flush_delayed~0=~y$flush_delayed~0_In1151893100, ~y~0=~y~0_In1151893100, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1151893100|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:45:19,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 14:45:19,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:45:19,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out441718142| |ULTIMATE.start_main_#t~ite58_Out441718142|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In441718142 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In441718142 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In441718142 |ULTIMATE.start_main_#t~ite58_Out441718142|) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out441718142| ~y~0_In441718142) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In441718142, ~y~0=~y~0_In441718142, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In441718142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441718142} OutVars{~y$w_buff1~0=~y$w_buff1~0_In441718142, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out441718142|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out441718142|, ~y~0=~y~0_In441718142, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In441718142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In441718142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:45:19,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1957666284 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1957666284 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1957666284|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1957666284 |ULTIMATE.start_main_#t~ite60_Out-1957666284|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1957666284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1957666284} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1957666284|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1957666284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1957666284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 14:45:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1019286821 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1019286821 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1019286821 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1019286821 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1019286821| ~y$w_buff1_used~0_In-1019286821) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1019286821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1019286821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1019286821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1019286821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1019286821} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1019286821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1019286821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1019286821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1019286821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1019286821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:45:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1045421140 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1045421140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1045421140| ~y$r_buff0_thd0~0_In-1045421140) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1045421140| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045421140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045421140} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1045421140|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045421140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1045421140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:45:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In62346324 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In62346324 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In62346324 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In62346324 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out62346324| ~y$r_buff1_thd0~0_In62346324) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out62346324|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In62346324, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In62346324, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In62346324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In62346324} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out62346324|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In62346324, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In62346324, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In62346324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In62346324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:45:19,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:45:19,909 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_df0b3445-0fc6-440f-bdf2-ed270256a877/bin/uautomizer/witness.graphml [2019-12-07 14:45:19,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:45:19,910 INFO L168 Benchmark]: Toolchain (without parser) took 91257.27 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 939.7 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,910 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:45:19,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:45:19,911 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,911 INFO L168 Benchmark]: RCFGBuilder took 447.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,911 INFO L168 Benchmark]: TraceAbstraction took 90265.34 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,912 INFO L168 Benchmark]: Witness Printer took 74.55 ms. Allocated memory is still 7.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:19,913 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90265.34 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 74.55 ms. Allocated memory is still 7.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6652 SDtfs, 11393 SDslu, 20074 SDs, 0 SdLazy, 7743 SolverSat, 423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136896occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 638989 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 227327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...