./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_rmo.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_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/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 5f5948a8471e3e9a8600e8f90a8b599954115139 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:08:19,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:08:19,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:08:19,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:08:19,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:08:19,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:08:19,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:08:19,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:08:19,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:08:19,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:08:19,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:08:19,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:08:19,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:08:19,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:08:19,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:08:19,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:08:19,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:08:19,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:08:19,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:08:19,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:08:19,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:08:19,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:08:19,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:08:19,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:08:19,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:08:19,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:08:19,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:08:19,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:08:19,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:08:19,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:08:19,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:08:19,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:08:19,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:08:19,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:08:19,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:08:19,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:08:19,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:08:19,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:08:19,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:08:19,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:08:19,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:08:19,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:08:19,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:08:19,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:08:19,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:08:19,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:08:19,676 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:08:19,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:08:19,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:08:19,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:08:19,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:08:19,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:08:19,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:08:19,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:08:19,680 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_bbb4193d-2046-4a91-9b87-6ecc31178dde/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 -> 5f5948a8471e3e9a8600e8f90a8b599954115139 [2019-12-07 10:08:19,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:08:19,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:08:19,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:08:19,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:08:19,794 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:08:19,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix027_rmo.opt.i [2019-12-07 10:08:19,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/data/1f27554d3/b419107242704b4b8adf9e2881cbda1f/FLAG9defc2243 [2019-12-07 10:08:20,340 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:08:20,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/sv-benchmarks/c/pthread-wmm/mix027_rmo.opt.i [2019-12-07 10:08:20,350 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/data/1f27554d3/b419107242704b4b8adf9e2881cbda1f/FLAG9defc2243 [2019-12-07 10:08:20,359 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/data/1f27554d3/b419107242704b4b8adf9e2881cbda1f [2019-12-07 10:08:20,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:08:20,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:08:20,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:08:20,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:08:20,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:08:20,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20, skipping insertion in model container [2019-12-07 10:08:20,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:08:20,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:08:20,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:08:20,658 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:08:20,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:08:20,750 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:08:20,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20 WrapperNode [2019-12-07 10:08:20,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:08:20,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:08:20,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:08:20,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:08:20,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:08:20,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:08:20,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:08:20,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:08:20,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... [2019-12-07 10:08:20,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:08:20,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:08:20,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:08:20,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:08:20,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/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 10:08:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:08:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:08:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:08:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:08:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:08:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:08:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:08:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:08:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:08:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:08:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:08:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:08:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:08:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:08:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:08:20,865 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 10:08:21,225 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:08:21,226 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:08:21,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:21 BoogieIcfgContainer [2019-12-07 10:08:21,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:08:21,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:08:21,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:08:21,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:08:21,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:08:20" (1/3) ... [2019-12-07 10:08:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6372ba25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:21, skipping insertion in model container [2019-12-07 10:08:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:20" (2/3) ... [2019-12-07 10:08:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6372ba25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:21, skipping insertion in model container [2019-12-07 10:08:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:21" (3/3) ... [2019-12-07 10:08:21,231 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2019-12-07 10:08:21,237 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:08:21,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:08:21,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:08:21,242 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:08:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,283 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:21,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:08:21,311 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:08:21,311 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:08:21,311 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:08:21,311 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:08:21,311 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:08:21,312 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:08:21,312 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:08:21,312 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:08:21,324 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-07 10:08:21,326 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 10:08:21,389 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 10:08:21,389 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:08:21,401 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:08:21,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 10:08:21,457 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 10:08:21,457 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:08:21,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 10:08:21,479 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 10:08:21,480 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:08:24,705 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 10:08:24,808 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-07 10:08:24,808 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 10:08:24,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-07 10:08:58,785 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-07 10:08:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-07 10:08:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:08:58,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:58,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:58,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-07 10:08:58,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:58,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898691953] [2019-12-07 10:08:58,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:58,951 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 10:08:58,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898691953] [2019-12-07 10:08:58,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:58,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:08:58,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863545910] [2019-12-07 10:08:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:58,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:58,967 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-07 10:09:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:01,867 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-07 10:09:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:01,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:09:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:02,570 INFO L225 Difference]: With dead ends: 169554 [2019-12-07 10:09:02,570 INFO L226 Difference]: Without dead ends: 159076 [2019-12-07 10:09:02,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 10:09:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-07 10:09:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-07 10:09:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-07 10:09:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-07 10:09:11,929 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-07 10:09:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:11,930 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-07 10:09:11,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-07 10:09:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:09:11,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:11,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:11,939 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-07 10:09:11,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:11,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693000395] [2019-12-07 10:09:11,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:12,013 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 10:09:12,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693000395] [2019-12-07 10:09:12,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:12,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:12,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461531408] [2019-12-07 10:09:12,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:12,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:12,015 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-07 10:09:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:16,175 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-07 10:09:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:16,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:09:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:16,892 INFO L225 Difference]: With dead ends: 251868 [2019-12-07 10:09:16,892 INFO L226 Difference]: Without dead ends: 251658 [2019-12-07 10:09:16,893 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 10:09:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-07 10:09:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-07 10:09:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-07 10:09:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-07 10:09:28,990 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-07 10:09:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:28,990 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-07 10:09:28,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-07 10:09:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:09:28,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:28,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:28,994 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-07 10:09:28,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:28,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300961060] [2019-12-07 10:09:28,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:29,035 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 10:09:29,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300961060] [2019-12-07 10:09:29,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:29,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:29,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040209722] [2019-12-07 10:09:29,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:29,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:29,036 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-07 10:09:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:29,699 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-07 10:09:29,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:29,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:09:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:30,140 INFO L225 Difference]: With dead ends: 146539 [2019-12-07 10:09:30,141 INFO L226 Difference]: Without dead ends: 146539 [2019-12-07 10:09:30,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-07 10:09:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-07 10:09:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-07 10:09:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-07 10:09:40,256 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-07 10:09:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:40,256 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-07 10:09:40,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-07 10:09:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:09:40,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:40,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:40,260 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-07 10:09:40,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:40,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047178955] [2019-12-07 10:09:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,299 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 10:09:40,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047178955] [2019-12-07 10:09:40,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:40,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:40,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138914600] [2019-12-07 10:09:40,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:40,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:40,300 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-07 10:09:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:40,452 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-07 10:09:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:09:40,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:09:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:40,522 INFO L225 Difference]: With dead ends: 40251 [2019-12-07 10:09:40,522 INFO L226 Difference]: Without dead ends: 40251 [2019-12-07 10:09:40,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-07 10:09:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-07 10:09:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-07 10:09:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-07 10:09:41,267 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-07 10:09:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:41,267 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-07 10:09:41,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-07 10:09:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:09:41,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:41,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:41,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:41,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-07 10:09:41,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:41,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225431831] [2019-12-07 10:09:41,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:41,334 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 10:09:41,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225431831] [2019-12-07 10:09:41,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:41,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:41,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773613681] [2019-12-07 10:09:41,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:41,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:41,335 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-07 10:09:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:41,717 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-07 10:09:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:41,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 10:09:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:41,826 INFO L225 Difference]: With dead ends: 58215 [2019-12-07 10:09:41,827 INFO L226 Difference]: Without dead ends: 58197 [2019-12-07 10:09:41,827 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 10:09:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-07 10:09:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-07 10:09:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-07 10:09:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-07 10:09:42,998 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-07 10:09:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,998 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-07 10:09:42,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-07 10:09:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:09:43,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,013 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] [2019-12-07 10:09:43,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-07 10:09:43,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65785298] [2019-12-07 10:09:43,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,106 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 10:09:43,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65785298] [2019-12-07 10:09:43,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:43,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90119805] [2019-12-07 10:09:43,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:43,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:43,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:43,108 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-07 10:09:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:43,771 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-07 10:09:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:09:43,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 10:09:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:43,901 INFO L225 Difference]: With dead ends: 73096 [2019-12-07 10:09:43,901 INFO L226 Difference]: Without dead ends: 73066 [2019-12-07 10:09:43,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:09:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-07 10:09:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-07 10:09:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-07 10:09:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-07 10:09:45,034 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-07 10:09:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:45,034 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-07 10:09:45,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-07 10:09:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:09:45,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:45,049 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] [2019-12-07 10:09:45,049 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-07 10:09:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:45,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954894201] [2019-12-07 10:09:45,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:45,129 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 10:09:45,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954894201] [2019-12-07 10:09:45,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:45,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:45,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130756410] [2019-12-07 10:09:45,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:45,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:45,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:45,131 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-07 10:09:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:45,864 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-07 10:09:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:09:45,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 10:09:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:45,994 INFO L225 Difference]: With dead ends: 73479 [2019-12-07 10:09:45,994 INFO L226 Difference]: Without dead ends: 73449 [2019-12-07 10:09:45,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:09:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-07 10:09:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-07 10:09:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-07 10:09:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-07 10:09:47,187 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-07 10:09:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:47,188 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-07 10:09:47,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-07 10:09:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:09:47,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:47,211 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] [2019-12-07 10:09:47,211 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-07 10:09:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:47,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97274912] [2019-12-07 10:09:47,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:47,249 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 10:09:47,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97274912] [2019-12-07 10:09:47,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:47,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369818219] [2019-12-07 10:09:47,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:47,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:47,250 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-07 10:09:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:47,360 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-07 10:09:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:47,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:09:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:47,408 INFO L225 Difference]: With dead ends: 26235 [2019-12-07 10:09:47,408 INFO L226 Difference]: Without dead ends: 26235 [2019-12-07 10:09:47,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-07 10:09:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-07 10:09:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-07 10:09:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-07 10:09:47,871 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-07 10:09:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-07 10:09:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-07 10:09:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:47,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:47,916 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] [2019-12-07 10:09:47,916 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-07 10:09:47,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:47,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897517100] [2019-12-07 10:09:47,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:47,969 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 10:09:47,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897517100] [2019-12-07 10:09:47,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:47,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:47,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892948560] [2019-12-07 10:09:47,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:47,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:47,970 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 5 states. [2019-12-07 10:09:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:48,399 INFO L93 Difference]: Finished difference Result 39949 states and 141241 transitions. [2019-12-07 10:09:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:48,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:09:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:48,465 INFO L225 Difference]: With dead ends: 39949 [2019-12-07 10:09:48,466 INFO L226 Difference]: Without dead ends: 39949 [2019-12-07 10:09:48,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39949 states. [2019-12-07 10:09:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39949 to 30867. [2019-12-07 10:09:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30867 states. [2019-12-07 10:09:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30867 states to 30867 states and 110440 transitions. [2019-12-07 10:09:49,076 INFO L78 Accepts]: Start accepts. Automaton has 30867 states and 110440 transitions. Word has length 42 [2019-12-07 10:09:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:49,077 INFO L462 AbstractCegarLoop]: Abstraction has 30867 states and 110440 transitions. [2019-12-07 10:09:49,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30867 states and 110440 transitions. [2019-12-07 10:09:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:49,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:49,118 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] [2019-12-07 10:09:49,118 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash -704987358, now seen corresponding path program 2 times [2019-12-07 10:09:49,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254181575] [2019-12-07 10:09:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:49,183 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 10:09:49,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254181575] [2019-12-07 10:09:49,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:49,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:49,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711691863] [2019-12-07 10:09:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:49,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:49,185 INFO L87 Difference]: Start difference. First operand 30867 states and 110440 transitions. Second operand 6 states. [2019-12-07 10:09:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:49,739 INFO L93 Difference]: Finished difference Result 40641 states and 143251 transitions. [2019-12-07 10:09:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:09:49,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 10:09:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:49,803 INFO L225 Difference]: With dead ends: 40641 [2019-12-07 10:09:49,803 INFO L226 Difference]: Without dead ends: 40641 [2019-12-07 10:09:49,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40641 states. [2019-12-07 10:09:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40641 to 34013. [2019-12-07 10:09:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34013 states. [2019-12-07 10:09:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34013 states to 34013 states and 121505 transitions. [2019-12-07 10:09:50,509 INFO L78 Accepts]: Start accepts. Automaton has 34013 states and 121505 transitions. Word has length 42 [2019-12-07 10:09:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:50,509 INFO L462 AbstractCegarLoop]: Abstraction has 34013 states and 121505 transitions. [2019-12-07 10:09:50,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34013 states and 121505 transitions. [2019-12-07 10:09:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:50,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:50,558 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] [2019-12-07 10:09:50,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash -956190570, now seen corresponding path program 3 times [2019-12-07 10:09:50,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:50,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783985343] [2019-12-07 10:09:50,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:50,612 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 10:09:50,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783985343] [2019-12-07 10:09:50,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:50,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:50,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584864738] [2019-12-07 10:09:50,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:50,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:50,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:50,614 INFO L87 Difference]: Start difference. First operand 34013 states and 121505 transitions. Second operand 6 states. [2019-12-07 10:09:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:51,194 INFO L93 Difference]: Finished difference Result 50452 states and 178693 transitions. [2019-12-07 10:09:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:09:51,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 10:09:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:51,291 INFO L225 Difference]: With dead ends: 50452 [2019-12-07 10:09:51,291 INFO L226 Difference]: Without dead ends: 50452 [2019-12-07 10:09:51,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:09:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50452 states. [2019-12-07 10:09:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50452 to 37407. [2019-12-07 10:09:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37407 states. [2019-12-07 10:09:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 132918 transitions. [2019-12-07 10:09:52,062 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 132918 transitions. Word has length 42 [2019-12-07 10:09:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:52,063 INFO L462 AbstractCegarLoop]: Abstraction has 37407 states and 132918 transitions. [2019-12-07 10:09:52,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 132918 transitions. [2019-12-07 10:09:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:09:52,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:52,108 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] [2019-12-07 10:09:52,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash -857618432, now seen corresponding path program 4 times [2019-12-07 10:09:52,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:52,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986263645] [2019-12-07 10:09:52,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:52,156 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 10:09:52,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986263645] [2019-12-07 10:09:52,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:52,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:52,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410766783] [2019-12-07 10:09:52,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:52,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:52,157 INFO L87 Difference]: Start difference. First operand 37407 states and 132918 transitions. Second operand 3 states. [2019-12-07 10:09:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:52,286 INFO L93 Difference]: Finished difference Result 37407 states and 132820 transitions. [2019-12-07 10:09:52,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:52,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 10:09:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:52,351 INFO L225 Difference]: With dead ends: 37407 [2019-12-07 10:09:52,351 INFO L226 Difference]: Without dead ends: 37407 [2019-12-07 10:09:52,351 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 10:09:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37407 states. [2019-12-07 10:09:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37407 to 33568. [2019-12-07 10:09:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33568 states. [2019-12-07 10:09:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33568 states to 33568 states and 119976 transitions. [2019-12-07 10:09:52,974 INFO L78 Accepts]: Start accepts. Automaton has 33568 states and 119976 transitions. Word has length 42 [2019-12-07 10:09:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:52,974 INFO L462 AbstractCegarLoop]: Abstraction has 33568 states and 119976 transitions. [2019-12-07 10:09:52,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33568 states and 119976 transitions. [2019-12-07 10:09:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:09:53,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:53,015 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] [2019-12-07 10:09:53,016 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-07 10:09:53,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:53,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953728443] [2019-12-07 10:09:53,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:53,214 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 10:09:53,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953728443] [2019-12-07 10:09:53,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:53,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:53,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073706357] [2019-12-07 10:09:53,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:09:53,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:09:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:53,215 INFO L87 Difference]: Start difference. First operand 33568 states and 119976 transitions. Second operand 7 states. [2019-12-07 10:09:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:53,859 INFO L93 Difference]: Finished difference Result 43448 states and 151617 transitions. [2019-12-07 10:09:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:09:53,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 10:09:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:53,929 INFO L225 Difference]: With dead ends: 43448 [2019-12-07 10:09:53,929 INFO L226 Difference]: Without dead ends: 43444 [2019-12-07 10:09:53,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:09:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43444 states. [2019-12-07 10:09:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43444 to 37111. [2019-12-07 10:09:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37111 states. [2019-12-07 10:09:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37111 states to 37111 states and 131645 transitions. [2019-12-07 10:09:54,630 INFO L78 Accepts]: Start accepts. Automaton has 37111 states and 131645 transitions. Word has length 43 [2019-12-07 10:09:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:54,630 INFO L462 AbstractCegarLoop]: Abstraction has 37111 states and 131645 transitions. [2019-12-07 10:09:54,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:09:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37111 states and 131645 transitions. [2019-12-07 10:09:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:09:54,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:54,675 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] [2019-12-07 10:09:54,675 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2106102698, now seen corresponding path program 2 times [2019-12-07 10:09:54,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:54,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556896176] [2019-12-07 10:09:54,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:54,837 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 10:09:54,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556896176] [2019-12-07 10:09:54,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:54,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:09:54,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832593915] [2019-12-07 10:09:54,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:09:54,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:09:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:54,838 INFO L87 Difference]: Start difference. First operand 37111 states and 131645 transitions. Second operand 9 states. [2019-12-07 10:09:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:55,913 INFO L93 Difference]: Finished difference Result 51524 states and 178854 transitions. [2019-12-07 10:09:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:09:55,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-07 10:09:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:56,004 INFO L225 Difference]: With dead ends: 51524 [2019-12-07 10:09:56,004 INFO L226 Difference]: Without dead ends: 51520 [2019-12-07 10:09:56,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:09:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51520 states. [2019-12-07 10:09:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51520 to 36637. [2019-12-07 10:09:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36637 states. [2019-12-07 10:09:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 130226 transitions. [2019-12-07 10:09:56,768 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 130226 transitions. Word has length 43 [2019-12-07 10:09:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:56,768 INFO L462 AbstractCegarLoop]: Abstraction has 36637 states and 130226 transitions. [2019-12-07 10:09:56,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:09:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 130226 transitions. [2019-12-07 10:09:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:09:56,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:56,812 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] [2019-12-07 10:09:56,812 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -643240245, now seen corresponding path program 1 times [2019-12-07 10:09:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:56,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683074805] [2019-12-07 10:09:56,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:56,847 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 10:09:56,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683074805] [2019-12-07 10:09:56,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:56,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:56,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357928893] [2019-12-07 10:09:56,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:56,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:56,848 INFO L87 Difference]: Start difference. First operand 36637 states and 130226 transitions. Second operand 3 states. [2019-12-07 10:09:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:56,975 INFO L93 Difference]: Finished difference Result 32999 states and 116083 transitions. [2019-12-07 10:09:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:56,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 10:09:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:57,030 INFO L225 Difference]: With dead ends: 32999 [2019-12-07 10:09:57,030 INFO L226 Difference]: Without dead ends: 32999 [2019-12-07 10:09:57,031 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 10:09:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32999 states. [2019-12-07 10:09:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32999 to 32019. [2019-12-07 10:09:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32019 states. [2019-12-07 10:09:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32019 states to 32019 states and 112805 transitions. [2019-12-07 10:09:57,642 INFO L78 Accepts]: Start accepts. Automaton has 32019 states and 112805 transitions. Word has length 43 [2019-12-07 10:09:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:57,642 INFO L462 AbstractCegarLoop]: Abstraction has 32019 states and 112805 transitions. [2019-12-07 10:09:57,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 32019 states and 112805 transitions. [2019-12-07 10:09:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:09:57,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:57,681 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] [2019-12-07 10:09:57,681 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:57,681 INFO L82 PathProgramCache]: Analyzing trace with hash -787469202, now seen corresponding path program 1 times [2019-12-07 10:09:57,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:57,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543646892] [2019-12-07 10:09:57,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:57,809 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 10:09:57,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543646892] [2019-12-07 10:09:57,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:57,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:57,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567672833] [2019-12-07 10:09:57,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:57,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:57,810 INFO L87 Difference]: Start difference. First operand 32019 states and 112805 transitions. Second operand 6 states. [2019-12-07 10:09:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:58,430 INFO L93 Difference]: Finished difference Result 70181 states and 245597 transitions. [2019-12-07 10:09:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:09:58,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 10:09:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:58,543 INFO L225 Difference]: With dead ends: 70181 [2019-12-07 10:09:58,543 INFO L226 Difference]: Without dead ends: 65923 [2019-12-07 10:09:58,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:09:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65923 states. [2019-12-07 10:09:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65923 to 41248. [2019-12-07 10:09:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41248 states. [2019-12-07 10:09:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41248 states to 41248 states and 139068 transitions. [2019-12-07 10:09:59,444 INFO L78 Accepts]: Start accepts. Automaton has 41248 states and 139068 transitions. Word has length 44 [2019-12-07 10:09:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:59,445 INFO L462 AbstractCegarLoop]: Abstraction has 41248 states and 139068 transitions. [2019-12-07 10:09:59,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 41248 states and 139068 transitions. [2019-12-07 10:09:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:09:59,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:59,490 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] [2019-12-07 10:09:59,490 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -634954953, now seen corresponding path program 1 times [2019-12-07 10:09:59,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:59,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375758419] [2019-12-07 10:09:59,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:59,710 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 10:09:59,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375758419] [2019-12-07 10:09:59,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:59,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:09:59,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861178437] [2019-12-07 10:09:59,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:09:59,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:09:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:09:59,712 INFO L87 Difference]: Start difference. First operand 41248 states and 139068 transitions. Second operand 10 states. [2019-12-07 10:10:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:01,636 INFO L93 Difference]: Finished difference Result 121475 states and 396089 transitions. [2019-12-07 10:10:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:10:01,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-12-07 10:10:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:01,941 INFO L225 Difference]: With dead ends: 121475 [2019-12-07 10:10:01,941 INFO L226 Difference]: Without dead ends: 108205 [2019-12-07 10:10:01,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:10:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108205 states. [2019-12-07 10:10:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108205 to 52121. [2019-12-07 10:10:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52121 states. [2019-12-07 10:10:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52121 states to 52121 states and 173903 transitions. [2019-12-07 10:10:03,181 INFO L78 Accepts]: Start accepts. Automaton has 52121 states and 173903 transitions. Word has length 45 [2019-12-07 10:10:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:03,181 INFO L462 AbstractCegarLoop]: Abstraction has 52121 states and 173903 transitions. [2019-12-07 10:10:03,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:10:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 52121 states and 173903 transitions. [2019-12-07 10:10:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:10:03,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:03,247 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] [2019-12-07 10:10:03,248 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 758150077, now seen corresponding path program 2 times [2019-12-07 10:10:03,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:03,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134853438] [2019-12-07 10:10:03,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:03,325 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 10:10:03,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134853438] [2019-12-07 10:10:03,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:03,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:10:03,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466412315] [2019-12-07 10:10:03,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:03,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:03,326 INFO L87 Difference]: Start difference. First operand 52121 states and 173903 transitions. Second operand 5 states. [2019-12-07 10:10:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:03,623 INFO L93 Difference]: Finished difference Result 92783 states and 309557 transitions. [2019-12-07 10:10:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:10:03,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 10:10:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:03,727 INFO L225 Difference]: With dead ends: 92783 [2019-12-07 10:10:03,727 INFO L226 Difference]: Without dead ends: 59963 [2019-12-07 10:10:03,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:10:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59963 states. [2019-12-07 10:10:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59963 to 43430. [2019-12-07 10:10:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43430 states. [2019-12-07 10:10:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43430 states to 43430 states and 146053 transitions. [2019-12-07 10:10:04,577 INFO L78 Accepts]: Start accepts. Automaton has 43430 states and 146053 transitions. Word has length 45 [2019-12-07 10:10:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:04,577 INFO L462 AbstractCegarLoop]: Abstraction has 43430 states and 146053 transitions. [2019-12-07 10:10:04,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:10:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 43430 states and 146053 transitions. [2019-12-07 10:10:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:10:04,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:04,624 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] [2019-12-07 10:10:04,624 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -696296869, now seen corresponding path program 3 times [2019-12-07 10:10:04,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:04,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496033379] [2019-12-07 10:10:04,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:04,674 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 10:10:04,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496033379] [2019-12-07 10:10:04,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:04,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:10:04,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929146876] [2019-12-07 10:10:04,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:10:04,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:10:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:10:04,675 INFO L87 Difference]: Start difference. First operand 43430 states and 146053 transitions. Second operand 6 states. [2019-12-07 10:10:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:04,833 INFO L93 Difference]: Finished difference Result 41061 states and 140628 transitions. [2019-12-07 10:10:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:10:04,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 10:10:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:04,890 INFO L225 Difference]: With dead ends: 41061 [2019-12-07 10:10:04,890 INFO L226 Difference]: Without dead ends: 37948 [2019-12-07 10:10:04,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:10:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37948 states. [2019-12-07 10:10:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37948 to 27228. [2019-12-07 10:10:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27228 states. [2019-12-07 10:10:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27228 states to 27228 states and 95811 transitions. [2019-12-07 10:10:05,524 INFO L78 Accepts]: Start accepts. Automaton has 27228 states and 95811 transitions. Word has length 45 [2019-12-07 10:10:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:05,524 INFO L462 AbstractCegarLoop]: Abstraction has 27228 states and 95811 transitions. [2019-12-07 10:10:05,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:10:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27228 states and 95811 transitions. [2019-12-07 10:10:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:10:05,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:05,557 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] [2019-12-07 10:10:05,557 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -205676228, now seen corresponding path program 1 times [2019-12-07 10:10:05,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:05,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271354115] [2019-12-07 10:10:05,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:05,588 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 10:10:05,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271354115] [2019-12-07 10:10:05,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:05,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:05,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912249545] [2019-12-07 10:10:05,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:10:05,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:10:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:10:05,590 INFO L87 Difference]: Start difference. First operand 27228 states and 95811 transitions. Second operand 3 states. [2019-12-07 10:10:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:05,720 INFO L93 Difference]: Finished difference Result 35178 states and 121447 transitions. [2019-12-07 10:10:05,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:10:05,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 10:10:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:05,775 INFO L225 Difference]: With dead ends: 35178 [2019-12-07 10:10:05,776 INFO L226 Difference]: Without dead ends: 35178 [2019-12-07 10:10:05,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:10:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35178 states. [2019-12-07 10:10:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35178 to 26411. [2019-12-07 10:10:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26411 states. [2019-12-07 10:10:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26411 states to 26411 states and 93194 transitions. [2019-12-07 10:10:06,306 INFO L78 Accepts]: Start accepts. Automaton has 26411 states and 93194 transitions. Word has length 59 [2019-12-07 10:10:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:06,306 INFO L462 AbstractCegarLoop]: Abstraction has 26411 states and 93194 transitions. [2019-12-07 10:10:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:10:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26411 states and 93194 transitions. [2019-12-07 10:10:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:10:06,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:06,339 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] [2019-12-07 10:10:06,339 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1547307155, now seen corresponding path program 1 times [2019-12-07 10:10:06,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:06,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182580066] [2019-12-07 10:10:06,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:06,396 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 10:10:06,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182580066] [2019-12-07 10:10:06,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:06,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:06,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969449945] [2019-12-07 10:10:06,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:10:06,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:10:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:10:06,397 INFO L87 Difference]: Start difference. First operand 26411 states and 93194 transitions. Second operand 4 states. [2019-12-07 10:10:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:06,568 INFO L93 Difference]: Finished difference Result 56954 states and 196966 transitions. [2019-12-07 10:10:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:10:06,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:10:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:06,594 INFO L225 Difference]: With dead ends: 56954 [2019-12-07 10:10:06,594 INFO L226 Difference]: Without dead ends: 21028 [2019-12-07 10:10:06,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:10:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21028 states. [2019-12-07 10:10:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21028 to 13860. [2019-12-07 10:10:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13860 states. [2019-12-07 10:10:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13860 states to 13860 states and 43375 transitions. [2019-12-07 10:10:06,858 INFO L78 Accepts]: Start accepts. Automaton has 13860 states and 43375 transitions. Word has length 59 [2019-12-07 10:10:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:06,858 INFO L462 AbstractCegarLoop]: Abstraction has 13860 states and 43375 transitions. [2019-12-07 10:10:06,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:10:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13860 states and 43375 transitions. [2019-12-07 10:10:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:10:06,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:06,872 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] [2019-12-07 10:10:06,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 2 times [2019-12-07 10:10:06,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:06,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240235201] [2019-12-07 10:10:06,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:10:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:10:06,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:10:06,952 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:10:06,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t733~0.base_21|) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21|)) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21|) |v_ULTIMATE.start_main_~#t733~0.offset_16| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 |v_ULTIMATE.start_main_~#t733~0.offset_16|) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t733~0.base_21| 4)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, ULTIMATE.start_main_~#t733~0.base=|v_ULTIMATE.start_main_~#t733~0.base_21|, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ULTIMATE.start_main_~#t733~0.offset=|v_ULTIMATE.start_main_~#t733~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t736~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t736~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t735~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t735~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t734~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t733~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t733~0.offset, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:10:06,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t734~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t734~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10|) |v_ULTIMATE.start_main_~#t734~0.offset_10| 1)) |v_#memory_int_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t734~0.base_10| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t734~0.base_10| 4)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_~#t734~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:10:06,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t735~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t735~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11|) |v_ULTIMATE.start_main_~#t735~0.offset_10| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t735~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t735~0.base_11| 4)) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t735~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t735~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:10:06,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:10:06,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t736~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t736~0.offset_10|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t736~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t736~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11|) |v_ULTIMATE.start_main_~#t736~0.offset_10| 3)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t736~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t736~0.offset] because there is no mapped edge [2019-12-07 10:10:06,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-97834117| |P3Thread1of1ForFork0_#t~ite32_Out-97834117|)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-97834117 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-97834117 256) 0))) (or (and .cse0 (= ~y~0_In-97834117 |P3Thread1of1ForFork0_#t~ite32_Out-97834117|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-97834117 |P3Thread1of1ForFork0_#t~ite32_Out-97834117|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-97834117, ~y$w_buff1~0=~y$w_buff1~0_In-97834117, ~y~0=~y~0_In-97834117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97834117} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-97834117, ~y$w_buff1~0=~y$w_buff1~0_In-97834117, ~y~0=~y~0_In-97834117, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-97834117|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-97834117|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97834117} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 10:10:06,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:10:06,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In1041155812 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1041155812 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1041155812| ~y$w_buff0_used~0_In1041155812)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out1041155812| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1041155812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1041155812} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1041155812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1041155812, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1041155812|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:10:06,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-872037224 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-872037224 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In-872037224 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-872037224 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-872037224|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-872037224 |P3Thread1of1ForFork0_#t~ite35_Out-872037224|) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-872037224, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-872037224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872037224, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872037224} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-872037224, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-872037224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872037224, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-872037224|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872037224} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 10:10:06,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In386598775 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In386598775 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out386598775|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In386598775 |P3Thread1of1ForFork0_#t~ite36_Out386598775|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386598775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386598775} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386598775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386598775, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out386598775|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 10:10:06,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1825162012 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1825162012 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1825162012 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1825162012 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out1825162012| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out1825162012| ~y$r_buff1_thd4~0_In1825162012) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1825162012, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1825162012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825162012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1825162012} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1825162012, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1825162012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825162012, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1825162012|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1825162012} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 10:10:06,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:10:06,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1101784427 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1101784427 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1101784427 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1101784427 256))) (= 0 (mod ~y$w_buff0_used~0_In-1101784427 256)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-1101784427| ~y$w_buff1~0_In-1101784427) (= |P1Thread1of1ForFork2_#t~ite12_Out-1101784427| |P1Thread1of1ForFork2_#t~ite11_Out-1101784427|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1101784427| ~y$w_buff1~0_In-1101784427) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-1101784427| |P1Thread1of1ForFork2_#t~ite11_Out-1101784427|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1101784427, ~y$w_buff1~0=~y$w_buff1~0_In-1101784427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1101784427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1101784427, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1101784427|, ~weak$$choice2~0=~weak$$choice2~0_In-1101784427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1101784427} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1101784427, ~y$w_buff1~0=~y$w_buff1~0_In-1101784427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1101784427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1101784427, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1101784427|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1101784427|, ~weak$$choice2~0=~weak$$choice2~0_In-1101784427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1101784427} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:10:06,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In760265765 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In760265765| |P1Thread1of1ForFork2_#t~ite14_Out760265765|) (= ~y$w_buff0_used~0_In760265765 |P1Thread1of1ForFork2_#t~ite15_Out760265765|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out760265765| |P1Thread1of1ForFork2_#t~ite15_Out760265765|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In760265765 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In760265765 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In760265765 256)) (and (= 0 (mod ~y$w_buff1_used~0_In760265765 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out760265765| ~y$w_buff0_used~0_In760265765)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760265765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760265765, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760265765, ~weak$$choice2~0=~weak$$choice2~0_In760265765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In760265765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760265765} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760265765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760265765, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760265765, ~weak$$choice2~0=~weak$$choice2~0_In760265765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out760265765|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out760265765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760265765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:10:06,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:10:06,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-103968607 256)))) (or (and (= ~y$r_buff1_thd2~0_In-103968607 |P1Thread1of1ForFork2_#t~ite23_Out-103968607|) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-103968607| |P1Thread1of1ForFork2_#t~ite24_Out-103968607|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-103968607 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-103968607 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-103968607 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-103968607 256) 0)))) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-103968607 |P1Thread1of1ForFork2_#t~ite24_Out-103968607|) (= |P1Thread1of1ForFork2_#t~ite23_In-103968607| |P1Thread1of1ForFork2_#t~ite23_Out-103968607|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-103968607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-103968607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-103968607, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-103968607|, ~weak$$choice2~0=~weak$$choice2~0_In-103968607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-103968607} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-103968607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-103968607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-103968607, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-103968607|, ~weak$$choice2~0=~weak$$choice2~0_In-103968607, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-103968607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-103968607} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:10:06,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:10:06,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-535386570 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-535386570 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-535386570| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-535386570| ~y$w_buff0_used~0_In-535386570)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-535386570|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 10:10:06,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1318651703 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1318651703 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1318651703 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1318651703 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out1318651703| ~y$w_buff1_used~0_In1318651703) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite29_Out1318651703| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1318651703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318651703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1318651703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318651703} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1318651703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318651703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1318651703, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1318651703|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318651703} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 10:10:06,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2000280432 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2000280432 256))) (.cse0 (= ~y$r_buff0_thd3~0_In-2000280432 ~y$r_buff0_thd3~0_Out-2000280432))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-2000280432 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2000280432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2000280432} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-2000280432|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2000280432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2000280432} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:10:06,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-380531429 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-380531429 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-380531429 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-380531429 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-380531429|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-380531429| ~y$r_buff1_thd3~0_In-380531429)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-380531429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-380531429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-380531429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-380531429} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-380531429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-380531429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-380531429, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-380531429|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-380531429} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 10:10:06,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 10:10:06,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:10:06,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite43_Out439139011| |ULTIMATE.start_main_#t~ite42_Out439139011|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In439139011 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In439139011 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In439139011 |ULTIMATE.start_main_#t~ite42_Out439139011|)) (and .cse1 (= ~y~0_In439139011 |ULTIMATE.start_main_#t~ite42_Out439139011|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In439139011, ~y~0=~y~0_In439139011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} OutVars{~y$w_buff1~0=~y$w_buff1~0_In439139011, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out439139011|, ~y~0=~y~0_In439139011, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out439139011|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:10:06,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1032287144 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1032287144 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1032287144| ~y$w_buff0_used~0_In-1032287144) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1032287144| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1032287144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032287144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1032287144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032287144, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1032287144|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:10:06,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-254870859 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-254870859 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-254870859 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-254870859 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-254870859| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-254870859| ~y$w_buff1_used~0_In-254870859) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-254870859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-254870859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-254870859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-254870859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-254870859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-254870859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-254870859, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-254870859|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-254870859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:10:06,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1799265621 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1799265621 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1799265621| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1799265621| ~y$r_buff0_thd0~0_In-1799265621)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799265621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1799265621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799265621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1799265621, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1799265621|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:10:06,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In10111743 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In10111743 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In10111743 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In10111743 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out10111743| ~y$r_buff1_thd0~0_In10111743) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite47_Out10111743| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In10111743, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10111743, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In10111743, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10111743} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In10111743, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10111743, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out10111743|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In10111743, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10111743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:10:06,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:10:07,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:10:07 BasicIcfg [2019-12-07 10:10:07,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:10:07,020 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:10:07,020 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:10:07,020 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:10:07,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:21" (3/4) ... [2019-12-07 10:10:07,022 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:10:07,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t733~0.base_21|) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t733~0.base_21|)) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t733~0.base_21|) |v_ULTIMATE.start_main_~#t733~0.offset_16| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 |v_ULTIMATE.start_main_~#t733~0.offset_16|) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t733~0.base_21| 4)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, ULTIMATE.start_main_~#t733~0.base=|v_ULTIMATE.start_main_~#t733~0.base_21|, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ULTIMATE.start_main_~#t733~0.offset=|v_ULTIMATE.start_main_~#t733~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t736~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t736~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t735~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t735~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t734~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t733~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t733~0.offset, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:10:07,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t734~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t734~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10|) |v_ULTIMATE.start_main_~#t734~0.offset_10| 1)) |v_#memory_int_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t734~0.base_10| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t734~0.base_10| 4)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_~#t734~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:10:07,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t735~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t735~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11|) |v_ULTIMATE.start_main_~#t735~0.offset_10| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t735~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t735~0.base_11| 4)) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t735~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t735~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:10:07,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:10:07,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t736~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t736~0.offset_10|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t736~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t736~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11|) |v_ULTIMATE.start_main_~#t736~0.offset_10| 3)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t736~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t736~0.offset] because there is no mapped edge [2019-12-07 10:10:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-97834117| |P3Thread1of1ForFork0_#t~ite32_Out-97834117|)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-97834117 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-97834117 256) 0))) (or (and .cse0 (= ~y~0_In-97834117 |P3Thread1of1ForFork0_#t~ite32_Out-97834117|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-97834117 |P3Thread1of1ForFork0_#t~ite32_Out-97834117|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-97834117, ~y$w_buff1~0=~y$w_buff1~0_In-97834117, ~y~0=~y~0_In-97834117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97834117} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-97834117, ~y$w_buff1~0=~y$w_buff1~0_In-97834117, ~y~0=~y~0_In-97834117, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-97834117|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-97834117|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97834117} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 10:10:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:10:07,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In1041155812 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1041155812 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1041155812| ~y$w_buff0_used~0_In1041155812)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out1041155812| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1041155812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1041155812} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1041155812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1041155812, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1041155812|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:10:07,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-872037224 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-872037224 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In-872037224 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-872037224 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-872037224|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-872037224 |P3Thread1of1ForFork0_#t~ite35_Out-872037224|) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-872037224, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-872037224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872037224, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872037224} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-872037224, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-872037224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872037224, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-872037224|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872037224} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 10:10:07,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In386598775 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In386598775 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out386598775|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In386598775 |P3Thread1of1ForFork0_#t~ite36_Out386598775|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386598775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386598775} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386598775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386598775, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out386598775|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 10:10:07,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1825162012 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1825162012 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1825162012 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1825162012 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out1825162012| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out1825162012| ~y$r_buff1_thd4~0_In1825162012) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1825162012, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1825162012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825162012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1825162012} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1825162012, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1825162012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825162012, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1825162012|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1825162012} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 10:10:07,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:10:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1101784427 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1101784427 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1101784427 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1101784427 256))) (= 0 (mod ~y$w_buff0_used~0_In-1101784427 256)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-1101784427| ~y$w_buff1~0_In-1101784427) (= |P1Thread1of1ForFork2_#t~ite12_Out-1101784427| |P1Thread1of1ForFork2_#t~ite11_Out-1101784427|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1101784427| ~y$w_buff1~0_In-1101784427) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-1101784427| |P1Thread1of1ForFork2_#t~ite11_Out-1101784427|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1101784427, ~y$w_buff1~0=~y$w_buff1~0_In-1101784427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1101784427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1101784427, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1101784427|, ~weak$$choice2~0=~weak$$choice2~0_In-1101784427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1101784427} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1101784427, ~y$w_buff1~0=~y$w_buff1~0_In-1101784427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1101784427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1101784427, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1101784427|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1101784427|, ~weak$$choice2~0=~weak$$choice2~0_In-1101784427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1101784427} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:10:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In760265765 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In760265765| |P1Thread1of1ForFork2_#t~ite14_Out760265765|) (= ~y$w_buff0_used~0_In760265765 |P1Thread1of1ForFork2_#t~ite15_Out760265765|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out760265765| |P1Thread1of1ForFork2_#t~ite15_Out760265765|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In760265765 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In760265765 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In760265765 256)) (and (= 0 (mod ~y$w_buff1_used~0_In760265765 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out760265765| ~y$w_buff0_used~0_In760265765)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760265765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760265765, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760265765, ~weak$$choice2~0=~weak$$choice2~0_In760265765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In760265765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760265765} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760265765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760265765, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760265765, ~weak$$choice2~0=~weak$$choice2~0_In760265765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out760265765|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out760265765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760265765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:10:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 10:10:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-103968607 256)))) (or (and (= ~y$r_buff1_thd2~0_In-103968607 |P1Thread1of1ForFork2_#t~ite23_Out-103968607|) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-103968607| |P1Thread1of1ForFork2_#t~ite24_Out-103968607|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-103968607 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-103968607 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-103968607 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-103968607 256) 0)))) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-103968607 |P1Thread1of1ForFork2_#t~ite24_Out-103968607|) (= |P1Thread1of1ForFork2_#t~ite23_In-103968607| |P1Thread1of1ForFork2_#t~ite23_Out-103968607|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-103968607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-103968607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-103968607, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-103968607|, ~weak$$choice2~0=~weak$$choice2~0_In-103968607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-103968607} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-103968607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-103968607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-103968607, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-103968607|, ~weak$$choice2~0=~weak$$choice2~0_In-103968607, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-103968607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-103968607} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:10:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:10:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-535386570 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-535386570 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-535386570| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-535386570| ~y$w_buff0_used~0_In-535386570)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-535386570|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 10:10:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1318651703 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1318651703 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1318651703 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1318651703 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out1318651703| ~y$w_buff1_used~0_In1318651703) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite29_Out1318651703| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1318651703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318651703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1318651703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318651703} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1318651703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318651703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1318651703, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1318651703|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318651703} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 10:10:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2000280432 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2000280432 256))) (.cse0 (= ~y$r_buff0_thd3~0_In-2000280432 ~y$r_buff0_thd3~0_Out-2000280432))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-2000280432 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2000280432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2000280432} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-2000280432|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2000280432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2000280432} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:10:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-380531429 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-380531429 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-380531429 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-380531429 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-380531429|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-380531429| ~y$r_buff1_thd3~0_In-380531429)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-380531429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-380531429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-380531429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-380531429} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-380531429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-380531429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-380531429, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-380531429|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-380531429} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 10:10:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 10:10:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:10:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite43_Out439139011| |ULTIMATE.start_main_#t~ite42_Out439139011|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In439139011 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In439139011 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In439139011 |ULTIMATE.start_main_#t~ite42_Out439139011|)) (and .cse1 (= ~y~0_In439139011 |ULTIMATE.start_main_#t~ite42_Out439139011|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In439139011, ~y~0=~y~0_In439139011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} OutVars{~y$w_buff1~0=~y$w_buff1~0_In439139011, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out439139011|, ~y~0=~y~0_In439139011, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out439139011|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:10:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1032287144 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1032287144 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1032287144| ~y$w_buff0_used~0_In-1032287144) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1032287144| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1032287144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032287144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1032287144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032287144, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1032287144|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:10:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-254870859 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-254870859 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-254870859 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-254870859 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-254870859| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-254870859| ~y$w_buff1_used~0_In-254870859) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-254870859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-254870859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-254870859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-254870859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-254870859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-254870859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-254870859, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-254870859|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-254870859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:10:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1799265621 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1799265621 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1799265621| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1799265621| ~y$r_buff0_thd0~0_In-1799265621)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799265621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1799265621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799265621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1799265621, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1799265621|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:10:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In10111743 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In10111743 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In10111743 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In10111743 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out10111743| ~y$r_buff1_thd0~0_In10111743) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite47_Out10111743| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In10111743, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10111743, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In10111743, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10111743} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In10111743, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10111743, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out10111743|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In10111743, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10111743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:10:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:10:07,087 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bbb4193d-2046-4a91-9b87-6ecc31178dde/bin/uautomizer/witness.graphml [2019-12-07 10:10:07,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:10:07,088 INFO L168 Benchmark]: Toolchain (without parser) took 106726.24 ms. Allocated memory was 1.0 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 943.5 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 10:10:07,088 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:10:07,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:10:07,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.92 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 10:10:07,089 INFO L168 Benchmark]: Boogie Preprocessor took 27.03 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 10:10:07,089 INFO L168 Benchmark]: RCFGBuilder took 408.69 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: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:10:07,090 INFO L168 Benchmark]: TraceAbstraction took 105792.38 ms. Allocated memory was 1.2 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 10:10:07,090 INFO L168 Benchmark]: Witness Printer took 67.63 ms. Allocated memory is still 8.0 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:10:07,091 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.92 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 27.03 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. * RCFGBuilder took 408.69 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: 56.7 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105792.38 ms. Allocated memory was 1.2 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 67.63 ms. Allocated memory is still 8.0 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t733, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L843] FCALL, FORK 0 pthread_create(&t734, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t735, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t736, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, x=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L758] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, x=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L758] 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) [L759] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, 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=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, 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=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, 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=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L762] 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)) [L764] 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)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, x=2, y=0, y$flush_delayed=9, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L795] 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) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=9, x=2, y=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L853] 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) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 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 [L856] 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 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4233 SDtfs, 5508 SDslu, 9442 SDs, 0 SdLazy, 6413 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 39 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 254944 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 718 ConstructedInterpolants, 0 QuantifiedInterpolants, 207761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...