./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_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_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/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 ac54514bebc477ac389e6294bf8af9decc225a8c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:15:40,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:15:40,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:15:40,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:15:40,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:15:40,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:15:40,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:15:40,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:15:40,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:15:40,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:15:40,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:15:40,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:15:40,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:15:40,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:15:40,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:15:40,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:15:40,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:15:40,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:15:40,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:15:40,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:15:40,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:15:40,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:15:40,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:15:40,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:15:40,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:15:40,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:15:40,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:15:40,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:15:40,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:15:40,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:15:40,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:15:40,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:15:40,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:15:40,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:15:40,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:15:40,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:15:40,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:15:40,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:15:40,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:15:40,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:15:40,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:15:40,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:15:40,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:15:40,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:15:40,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:15:40,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:15:40,973 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:15:40,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:15:40,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:15:40,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:15:40,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:15:40,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:15:40,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:15:40,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:15:40,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:15:40,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:15:40,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:15:40,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:15:40,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:15:40,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:15:40,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:15:40,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:15:40,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:15:40,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:15:40,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:15:40,977 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_a4baf9fd-11fc-4127-9969-977744402581/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 -> ac54514bebc477ac389e6294bf8af9decc225a8c [2019-12-07 16:15:41,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:15:41,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:15:41,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:15:41,118 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:15:41,118 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:15:41,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i [2019-12-07 16:15:41,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/data/ba5d3b19e/23d5655f061745da8b276bdc2b4d1ffe/FLAG2e75981fa [2019-12-07 16:15:41,673 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:15:41,674 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/sv-benchmarks/c/pthread-wmm/mix002_rmo.opt.i [2019-12-07 16:15:41,685 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/data/ba5d3b19e/23d5655f061745da8b276bdc2b4d1ffe/FLAG2e75981fa [2019-12-07 16:15:42,191 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/data/ba5d3b19e/23d5655f061745da8b276bdc2b4d1ffe [2019-12-07 16:15:42,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:15:42,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:15:42,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:15:42,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:15:42,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:15:42,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dd5335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42, skipping insertion in model container [2019-12-07 16:15:42,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:15:42,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:15:42,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:15:42,493 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:15:42,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:15:42,588 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:15:42,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42 WrapperNode [2019-12-07 16:15:42,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:15:42,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:15:42,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:15:42,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:15:42,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:15:42,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:15:42,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:15:42,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:15:42,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... [2019-12-07 16:15:42,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:15:42,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:15:42,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:15:42,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:15:42,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/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 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:15:42,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:15:42,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:15:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:15:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:15:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:15:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:15:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:15:42,709 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 16:15:43,108 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:15:43,109 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:15:43,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:43 BoogieIcfgContainer [2019-12-07 16:15:43,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:15:43,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:15:43,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:15:43,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:15:43,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:15:42" (1/3) ... [2019-12-07 16:15:43,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f542c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:15:43, skipping insertion in model container [2019-12-07 16:15:43,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:42" (2/3) ... [2019-12-07 16:15:43,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f542c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:15:43, skipping insertion in model container [2019-12-07 16:15:43,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:43" (3/3) ... [2019-12-07 16:15:43,114 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.opt.i [2019-12-07 16:15:43,120 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:15:43,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:15:43,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:15:43,126 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:15:43,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:15:43,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:15:43,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:15:43,203 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:15:43,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:15:43,203 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:15:43,203 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:15:43,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:15:43,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:15:43,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:15:43,217 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 16:15:43,218 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 16:15:43,293 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 16:15:43,294 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:15:43,309 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 16:15:43,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 16:15:43,375 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 16:15:43,375 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:15:43,384 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 16:15:43,408 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 16:15:43,409 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:15:47,013 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 16:15:47,254 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 16:15:47,370 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 16:15:47,370 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 16:15:47,372 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 16:15:49,911 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 16:15:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 16:15:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:15:49,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:49,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:49,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 16:15:49,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:49,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923212059] [2019-12-07 16:15:49,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:50,115 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 16:15:50,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923212059] [2019-12-07 16:15:50,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:50,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:15:50,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437458339] [2019-12-07 16:15:50,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:15:50,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:15:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:15:50,130 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 16:15:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:50,519 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 16:15:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:15:50,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 16:15:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:50,757 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 16:15:50,757 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 16:15:50,758 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 16:15:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 16:15:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 16:15:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 16:15:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 16:15:52,169 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 16:15:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:52,170 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 16:15:52,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:15:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 16:15:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:15:52,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:52,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:52,174 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 16:15:52,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:52,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933618354] [2019-12-07 16:15:52,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:52,228 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 16:15:52,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933618354] [2019-12-07 16:15:52,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:52,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:15:52,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014166244] [2019-12-07 16:15:52,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:15:52,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:15:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:15:52,231 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 3 states. [2019-12-07 16:15:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:52,350 INFO L93 Difference]: Finished difference Result 21910 states and 79049 transitions. [2019-12-07 16:15:52,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:15:52,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 16:15:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:52,411 INFO L225 Difference]: With dead ends: 21910 [2019-12-07 16:15:52,411 INFO L226 Difference]: Without dead ends: 21910 [2019-12-07 16:15:52,412 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 16:15:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21910 states. [2019-12-07 16:15:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21910 to 21910. [2019-12-07 16:15:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21910 states. [2019-12-07 16:15:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21910 states to 21910 states and 79049 transitions. [2019-12-07 16:15:53,055 INFO L78 Accepts]: Start accepts. Automaton has 21910 states and 79049 transitions. Word has length 13 [2019-12-07 16:15:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:53,055 INFO L462 AbstractCegarLoop]: Abstraction has 21910 states and 79049 transitions. [2019-12-07 16:15:53,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:15:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21910 states and 79049 transitions. [2019-12-07 16:15:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:15:53,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:53,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:53,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1741557527, now seen corresponding path program 1 times [2019-12-07 16:15:53,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:53,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784541801] [2019-12-07 16:15:53,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:53,098 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 16:15:53,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784541801] [2019-12-07 16:15:53,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:53,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:15:53,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031253319] [2019-12-07 16:15:53,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:15:53,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:15:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:15:53,099 INFO L87 Difference]: Start difference. First operand 21910 states and 79049 transitions. Second operand 4 states. [2019-12-07 16:15:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:53,123 INFO L93 Difference]: Finished difference Result 4012 states and 11813 transitions. [2019-12-07 16:15:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:15:53,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:15:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:53,129 INFO L225 Difference]: With dead ends: 4012 [2019-12-07 16:15:53,129 INFO L226 Difference]: Without dead ends: 4012 [2019-12-07 16:15:53,129 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 16:15:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-07 16:15:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 4012. [2019-12-07 16:15:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2019-12-07 16:15:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 11813 transitions. [2019-12-07 16:15:53,178 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 11813 transitions. Word has length 14 [2019-12-07 16:15:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:53,178 INFO L462 AbstractCegarLoop]: Abstraction has 4012 states and 11813 transitions. [2019-12-07 16:15:53,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:15:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 11813 transitions. [2019-12-07 16:15:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:15:53,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:53,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:53,179 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 16:15:53,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:53,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387022268] [2019-12-07 16:15:53,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:53,226 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 16:15:53,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387022268] [2019-12-07 16:15:53,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:53,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:15:53,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680484672] [2019-12-07 16:15:53,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:15:53,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:15:53,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:15:53,228 INFO L87 Difference]: Start difference. First operand 4012 states and 11813 transitions. Second operand 4 states. [2019-12-07 16:15:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:53,387 INFO L93 Difference]: Finished difference Result 5547 states and 15887 transitions. [2019-12-07 16:15:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:53,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 16:15:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:53,394 INFO L225 Difference]: With dead ends: 5547 [2019-12-07 16:15:53,394 INFO L226 Difference]: Without dead ends: 5547 [2019-12-07 16:15:53,394 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 16:15:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2019-12-07 16:15:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 5455. [2019-12-07 16:15:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5455 states. [2019-12-07 16:15:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 15718 transitions. [2019-12-07 16:15:53,462 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 15718 transitions. Word has length 16 [2019-12-07 16:15:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:53,462 INFO L462 AbstractCegarLoop]: Abstraction has 5455 states and 15718 transitions. [2019-12-07 16:15:53,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:15:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 15718 transitions. [2019-12-07 16:15:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:15:53,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:53,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:53,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 16:15:53,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:53,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110254302] [2019-12-07 16:15:53,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:53,486 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 16:15:53,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110254302] [2019-12-07 16:15:53,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:53,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:15:53,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818546728] [2019-12-07 16:15:53,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:15:53,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:15:53,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:15:53,488 INFO L87 Difference]: Start difference. First operand 5455 states and 15718 transitions. Second operand 3 states. [2019-12-07 16:15:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:53,546 INFO L93 Difference]: Finished difference Result 9509 states and 25812 transitions. [2019-12-07 16:15:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:15:53,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:15:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:53,556 INFO L225 Difference]: With dead ends: 9509 [2019-12-07 16:15:53,556 INFO L226 Difference]: Without dead ends: 9509 [2019-12-07 16:15:53,556 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 16:15:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9509 states. [2019-12-07 16:15:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9509 to 8645. [2019-12-07 16:15:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-12-07 16:15:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 23870 transitions. [2019-12-07 16:15:53,667 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 23870 transitions. Word has length 17 [2019-12-07 16:15:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:53,667 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 23870 transitions. [2019-12-07 16:15:53,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:15:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 23870 transitions. [2019-12-07 16:15:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:15:53,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:53,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:53,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 16:15:53,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:53,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248331755] [2019-12-07 16:15:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:53,712 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 16:15:53,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248331755] [2019-12-07 16:15:53,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:53,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:15:53,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327643287] [2019-12-07 16:15:53,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:15:53,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:15:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:15:53,714 INFO L87 Difference]: Start difference. First operand 8645 states and 23870 transitions. Second operand 4 states. [2019-12-07 16:15:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:53,906 INFO L93 Difference]: Finished difference Result 10846 states and 29430 transitions. [2019-12-07 16:15:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:53,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 16:15:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:53,917 INFO L225 Difference]: With dead ends: 10846 [2019-12-07 16:15:53,917 INFO L226 Difference]: Without dead ends: 10846 [2019-12-07 16:15:53,917 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 16:15:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10846 states. [2019-12-07 16:15:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10846 to 8676. [2019-12-07 16:15:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8676 states. [2019-12-07 16:15:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8676 states to 8676 states and 23953 transitions. [2019-12-07 16:15:54,022 INFO L78 Accepts]: Start accepts. Automaton has 8676 states and 23953 transitions. Word has length 19 [2019-12-07 16:15:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:54,023 INFO L462 AbstractCegarLoop]: Abstraction has 8676 states and 23953 transitions. [2019-12-07 16:15:54,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:15:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8676 states and 23953 transitions. [2019-12-07 16:15:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:15:54,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,030 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] [2019-12-07 16:15:54,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 16:15:54,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:54,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453843337] [2019-12-07 16:15:54,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,072 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 16:15:54,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453843337] [2019-12-07 16:15:54,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:54,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:15:54,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699646744] [2019-12-07 16:15:54,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:15:54,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:15:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:15:54,073 INFO L87 Difference]: Start difference. First operand 8676 states and 23953 transitions. Second operand 5 states. [2019-12-07 16:15:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:54,109 INFO L93 Difference]: Finished difference Result 6781 states and 19450 transitions. [2019-12-07 16:15:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:54,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 16:15:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:54,117 INFO L225 Difference]: With dead ends: 6781 [2019-12-07 16:15:54,117 INFO L226 Difference]: Without dead ends: 6781 [2019-12-07 16:15:54,117 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 16:15:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2019-12-07 16:15:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 6475. [2019-12-07 16:15:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6475 states. [2019-12-07 16:15:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6475 states to 6475 states and 18723 transitions. [2019-12-07 16:15:54,189 INFO L78 Accepts]: Start accepts. Automaton has 6475 states and 18723 transitions. Word has length 31 [2019-12-07 16:15:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:54,189 INFO L462 AbstractCegarLoop]: Abstraction has 6475 states and 18723 transitions. [2019-12-07 16:15:54,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:15:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6475 states and 18723 transitions. [2019-12-07 16:15:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 16:15:54,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:54,198 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1974047026, now seen corresponding path program 1 times [2019-12-07 16:15:54,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:54,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110396075] [2019-12-07 16:15:54,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,266 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 16:15:54,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110396075] [2019-12-07 16:15:54,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:54,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:15:54,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531209599] [2019-12-07 16:15:54,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:15:54,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:15:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:15:54,268 INFO L87 Difference]: Start difference. First operand 6475 states and 18723 transitions. Second operand 5 states. [2019-12-07 16:15:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:54,617 INFO L93 Difference]: Finished difference Result 7708 states and 21853 transitions. [2019-12-07 16:15:54,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:15:54,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-07 16:15:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:54,626 INFO L225 Difference]: With dead ends: 7708 [2019-12-07 16:15:54,626 INFO L226 Difference]: Without dead ends: 7708 [2019-12-07 16:15:54,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7708 states. [2019-12-07 16:15:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7708 to 7217. [2019-12-07 16:15:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7217 states. [2019-12-07 16:15:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 20672 transitions. [2019-12-07 16:15:54,714 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 20672 transitions. Word has length 61 [2019-12-07 16:15:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:54,714 INFO L462 AbstractCegarLoop]: Abstraction has 7217 states and 20672 transitions. [2019-12-07 16:15:54,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:15:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 20672 transitions. [2019-12-07 16:15:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 16:15:54,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:54,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1578629908, now seen corresponding path program 2 times [2019-12-07 16:15:54,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:54,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994228305] [2019-12-07 16:15:54,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,868 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 16:15:54,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994228305] [2019-12-07 16:15:54,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:54,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:15:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547486470] [2019-12-07 16:15:54,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:15:54,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:15:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:15:54,869 INFO L87 Difference]: Start difference. First operand 7217 states and 20672 transitions. Second operand 9 states. [2019-12-07 16:15:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:55,382 INFO L93 Difference]: Finished difference Result 10776 states and 30221 transitions. [2019-12-07 16:15:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:15:55,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-12-07 16:15:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:55,392 INFO L225 Difference]: With dead ends: 10776 [2019-12-07 16:15:55,393 INFO L226 Difference]: Without dead ends: 10776 [2019-12-07 16:15:55,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:15:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2019-12-07 16:15:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 8475. [2019-12-07 16:15:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8475 states. [2019-12-07 16:15:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8475 states to 8475 states and 24093 transitions. [2019-12-07 16:15:55,505 INFO L78 Accepts]: Start accepts. Automaton has 8475 states and 24093 transitions. Word has length 61 [2019-12-07 16:15:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 8475 states and 24093 transitions. [2019-12-07 16:15:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:15:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8475 states and 24093 transitions. [2019-12-07 16:15:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:15:55,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:55,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:55,516 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash -747003263, now seen corresponding path program 1 times [2019-12-07 16:15:55,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:55,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371792224] [2019-12-07 16:15:55,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:55,574 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 16:15:55,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371792224] [2019-12-07 16:15:55,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:55,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:15:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176660045] [2019-12-07 16:15:55,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:15:55,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:15:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:15:55,575 INFO L87 Difference]: Start difference. First operand 8475 states and 24093 transitions. Second operand 3 states. [2019-12-07 16:15:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:55,601 INFO L93 Difference]: Finished difference Result 8475 states and 24092 transitions. [2019-12-07 16:15:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:15:55,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 16:15:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:55,614 INFO L225 Difference]: With dead ends: 8475 [2019-12-07 16:15:55,614 INFO L226 Difference]: Without dead ends: 8475 [2019-12-07 16:15:55,614 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 16:15:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8475 states. [2019-12-07 16:15:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8475 to 8072. [2019-12-07 16:15:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-12-07 16:15:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 23133 transitions. [2019-12-07 16:15:55,714 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 23133 transitions. Word has length 62 [2019-12-07 16:15:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:55,715 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 23133 transitions. [2019-12-07 16:15:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:15:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 23133 transitions. [2019-12-07 16:15:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:15:55,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:55,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:55,726 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 1 times [2019-12-07 16:15:55,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:55,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877182544] [2019-12-07 16:15:55,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:55,834 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 16:15:55,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877182544] [2019-12-07 16:15:55,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:55,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:15:55,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870701011] [2019-12-07 16:15:55,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:15:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:15:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:55,835 INFO L87 Difference]: Start difference. First operand 8072 states and 23133 transitions. Second operand 6 states. [2019-12-07 16:15:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:56,070 INFO L93 Difference]: Finished difference Result 10337 states and 29125 transitions. [2019-12-07 16:15:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:15:56,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 16:15:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:56,080 INFO L225 Difference]: With dead ends: 10337 [2019-12-07 16:15:56,081 INFO L226 Difference]: Without dead ends: 10337 [2019-12-07 16:15:56,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:15:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10337 states. [2019-12-07 16:15:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10337 to 8766. [2019-12-07 16:15:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-07 16:15:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 24964 transitions. [2019-12-07 16:15:56,182 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 24964 transitions. Word has length 62 [2019-12-07 16:15:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:56,183 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 24964 transitions. [2019-12-07 16:15:56,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:15:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 24964 transitions. [2019-12-07 16:15:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:56,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:56,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:56,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 16:15:56,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:56,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335002311] [2019-12-07 16:15:56,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:56,293 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 16:15:56,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335002311] [2019-12-07 16:15:56,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:56,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:15:56,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380319837] [2019-12-07 16:15:56,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:15:56,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:56,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:15:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:56,294 INFO L87 Difference]: Start difference. First operand 8766 states and 24964 transitions. Second operand 6 states. [2019-12-07 16:15:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:56,458 INFO L93 Difference]: Finished difference Result 14879 states and 42612 transitions. [2019-12-07 16:15:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:15:56,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 16:15:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:56,472 INFO L225 Difference]: With dead ends: 14879 [2019-12-07 16:15:56,473 INFO L226 Difference]: Without dead ends: 12976 [2019-12-07 16:15:56,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:15:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2019-12-07 16:15:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 11106. [2019-12-07 16:15:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11106 states. [2019-12-07 16:15:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11106 states to 11106 states and 31892 transitions. [2019-12-07 16:15:56,610 INFO L78 Accepts]: Start accepts. Automaton has 11106 states and 31892 transitions. Word has length 63 [2019-12-07 16:15:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:56,610 INFO L462 AbstractCegarLoop]: Abstraction has 11106 states and 31892 transitions. [2019-12-07 16:15:56,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:15:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11106 states and 31892 transitions. [2019-12-07 16:15:56,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:56,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:56,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1785952972, now seen corresponding path program 2 times [2019-12-07 16:15:56,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:56,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226054025] [2019-12-07 16:15:56,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:56,718 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 16:15:56,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226054025] [2019-12-07 16:15:56,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:56,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:15:56,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769968159] [2019-12-07 16:15:56,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:15:56,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:56,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:15:56,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:15:56,720 INFO L87 Difference]: Start difference. First operand 11106 states and 31892 transitions. Second operand 4 states. [2019-12-07 16:15:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:56,796 INFO L93 Difference]: Finished difference Result 12224 states and 34410 transitions. [2019-12-07 16:15:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:56,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 16:15:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:56,811 INFO L225 Difference]: With dead ends: 12224 [2019-12-07 16:15:56,811 INFO L226 Difference]: Without dead ends: 10542 [2019-12-07 16:15:56,811 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 16:15:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2019-12-07 16:15:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 9474. [2019-12-07 16:15:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9474 states. [2019-12-07 16:15:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 26269 transitions. [2019-12-07 16:15:56,920 INFO L78 Accepts]: Start accepts. Automaton has 9474 states and 26269 transitions. Word has length 63 [2019-12-07 16:15:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:56,920 INFO L462 AbstractCegarLoop]: Abstraction has 9474 states and 26269 transitions. [2019-12-07 16:15:56,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:15:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9474 states and 26269 transitions. [2019-12-07 16:15:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:56,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:56,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:56,931 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -437937848, now seen corresponding path program 3 times [2019-12-07 16:15:56,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:56,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381382893] [2019-12-07 16:15:56,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:57,014 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 16:15:57,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381382893] [2019-12-07 16:15:57,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:57,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:15:57,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840609480] [2019-12-07 16:15:57,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:15:57,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:15:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:15:57,015 INFO L87 Difference]: Start difference. First operand 9474 states and 26269 transitions. Second operand 5 states. [2019-12-07 16:15:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:57,074 INFO L93 Difference]: Finished difference Result 10592 states and 28787 transitions. [2019-12-07 16:15:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:57,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 16:15:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:57,083 INFO L225 Difference]: With dead ends: 10592 [2019-12-07 16:15:57,084 INFO L226 Difference]: Without dead ends: 6667 [2019-12-07 16:15:57,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2019-12-07 16:15:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6667. [2019-12-07 16:15:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6667 states. [2019-12-07 16:15:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 16794 transitions. [2019-12-07 16:15:57,163 INFO L78 Accepts]: Start accepts. Automaton has 6667 states and 16794 transitions. Word has length 63 [2019-12-07 16:15:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:57,163 INFO L462 AbstractCegarLoop]: Abstraction has 6667 states and 16794 transitions. [2019-12-07 16:15:57,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:15:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 16794 transitions. [2019-12-07 16:15:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:57,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:57,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:57,168 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1580623076, now seen corresponding path program 4 times [2019-12-07 16:15:57,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:57,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114300804] [2019-12-07 16:15:57,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:57,251 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 16:15:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114300804] [2019-12-07 16:15:57,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:57,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:15:57,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474158947] [2019-12-07 16:15:57,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:15:57,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:15:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:15:57,252 INFO L87 Difference]: Start difference. First operand 6667 states and 16794 transitions. Second operand 4 states. [2019-12-07 16:15:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:57,297 INFO L93 Difference]: Finished difference Result 7357 states and 18344 transitions. [2019-12-07 16:15:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:57,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 16:15:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:57,303 INFO L225 Difference]: With dead ends: 7357 [2019-12-07 16:15:57,303 INFO L226 Difference]: Without dead ends: 5636 [2019-12-07 16:15:57,303 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 16:15:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2019-12-07 16:15:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 4996. [2019-12-07 16:15:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2019-12-07 16:15:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 12674 transitions. [2019-12-07 16:15:57,359 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 12674 transitions. Word has length 63 [2019-12-07 16:15:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:57,359 INFO L462 AbstractCegarLoop]: Abstraction has 4996 states and 12674 transitions. [2019-12-07 16:15:57,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:15:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 12674 transitions. [2019-12-07 16:15:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:57,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:57,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:57,363 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash 76538126, now seen corresponding path program 5 times [2019-12-07 16:15:57,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:57,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770641612] [2019-12-07 16:15:57,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:57,433 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 16:15:57,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770641612] [2019-12-07 16:15:57,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:57,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:15:57,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042058127] [2019-12-07 16:15:57,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:15:57,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:57,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:15:57,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:15:57,435 INFO L87 Difference]: Start difference. First operand 4996 states and 12674 transitions. Second operand 5 states. [2019-12-07 16:15:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:57,466 INFO L93 Difference]: Finished difference Result 5680 states and 14214 transitions. [2019-12-07 16:15:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:57,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 16:15:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:57,467 INFO L225 Difference]: With dead ends: 5680 [2019-12-07 16:15:57,467 INFO L226 Difference]: Without dead ends: 769 [2019-12-07 16:15:57,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-07 16:15:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2019-12-07 16:15:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-07 16:15:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1671 transitions. [2019-12-07 16:15:57,473 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1671 transitions. Word has length 63 [2019-12-07 16:15:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:57,474 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1671 transitions. [2019-12-07 16:15:57,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:15:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1671 transitions. [2019-12-07 16:15:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:57,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:57,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:57,474 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 6 times [2019-12-07 16:15:57,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:57,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763380492] [2019-12-07 16:15:57,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:57,560 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 16:15:57,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763380492] [2019-12-07 16:15:57,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:57,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:15:57,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998979333] [2019-12-07 16:15:57,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:15:57,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:15:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:15:57,561 INFO L87 Difference]: Start difference. First operand 769 states and 1671 transitions. Second operand 8 states. [2019-12-07 16:15:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:57,718 INFO L93 Difference]: Finished difference Result 1431 states and 3053 transitions. [2019-12-07 16:15:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:15:57,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 16:15:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:57,719 INFO L225 Difference]: With dead ends: 1431 [2019-12-07 16:15:57,719 INFO L226 Difference]: Without dead ends: 1013 [2019-12-07 16:15:57,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:15:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-07 16:15:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 835. [2019-12-07 16:15:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-07 16:15:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1781 transitions. [2019-12-07 16:15:57,726 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1781 transitions. Word has length 63 [2019-12-07 16:15:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:57,726 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1781 transitions. [2019-12-07 16:15:57,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:15:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1781 transitions. [2019-12-07 16:15:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:15:57,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:57,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:57,727 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 7 times [2019-12-07 16:15:57,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:57,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718060301] [2019-12-07 16:15:57,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:15:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:15:57,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:15:57,803 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:15:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t53~0.base_132|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t53~0.base_132| 4) |v_#length_23|) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= (store .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132| 1) |v_#valid_167|) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132|) |v_ULTIMATE.start_main_~#t53~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132|)) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= 0 |v_ULTIMATE.start_main_~#t53~0.offset_73|) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_56|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_34|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ULTIMATE.start_main_~#t53~0.base=|v_ULTIMATE.start_main_~#t53~0.base_132|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ULTIMATE.start_main_~#t53~0.offset=|v_ULTIMATE.start_main_~#t53~0.offset_73|, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t55~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t55~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t53~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t54~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t54~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t53~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t54~0.base_10| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10|) |v_ULTIMATE.start_main_~#t54~0.offset_9| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t54~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t54~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t54~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t54~0.offset, #length, ULTIMATE.start_main_~#t54~0.base] because there is no mapped edge [2019-12-07 16:15:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t55~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t55~0.base_11|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11|) |v_ULTIMATE.start_main_~#t55~0.offset_9| 2))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t55~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t55~0.base_11| 4) |v_#length_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t55~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t55~0.offset] because there is no mapped edge [2019-12-07 16:15:57,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 16:15:57,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1303418113| |P2Thread1of1ForFork0_#t~ite28_Out-1303418113|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1303418113 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1303418113 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1303418113| ~z$w_buff0~0_In-1303418113) (not .cse0) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1303418113| ~z$w_buff1~0_In-1303418113) .cse1 (or .cse0 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1303418113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303418113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303418113, ~z$w_buff1~0=~z$w_buff1~0_In-1303418113} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1303418113|, ~z$w_buff0~0=~z$w_buff0~0_In-1303418113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303418113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303418113, ~z$w_buff1~0=~z$w_buff1~0_In-1303418113, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1303418113|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:15:57,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:15:57,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1879585881 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1879585881| ~z$mem_tmp~0_In-1879585881)) (and .cse0 (= ~z~0_In-1879585881 |P2Thread1of1ForFork0_#t~ite48_Out-1879585881|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1879585881, ~z$flush_delayed~0=~z$flush_delayed~0_In-1879585881, ~z~0=~z~0_In-1879585881} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1879585881|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1879585881, ~z$flush_delayed~0=~z$flush_delayed~0_In-1879585881, ~z~0=~z~0_In-1879585881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 16:15:57,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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 16:15:57,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In67138005 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In67138005 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out67138005| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In67138005 |P2Thread1of1ForFork0_#t~ite51_Out67138005|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In67138005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In67138005} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In67138005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In67138005, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out67138005|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1353640172 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1353640172| ~z$mem_tmp~0_In-1353640172) (not .cse0)) (and .cse0 (= ~z~0_In-1353640172 |P1Thread1of1ForFork2_#t~ite25_Out-1353640172|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1353640172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1353640172, ~z~0=~z~0_In-1353640172} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1353640172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1353640172, ~z~0=~z~0_In-1353640172, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1353640172|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In312790601 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In312790601 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In312790601 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In312790601 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out312790601|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In312790601 |P2Thread1of1ForFork0_#t~ite52_Out312790601|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In312790601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312790601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312790601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312790601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In312790601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312790601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312790601, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out312790601|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312790601} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In981987622 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In981987622 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In981987622 ~z$r_buff0_thd3~0_Out981987622))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out981987622) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In981987622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In981987622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In981987622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out981987622, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out981987622|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1425203712 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1425203712 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1425203712 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1425203712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1425203712 |P2Thread1of1ForFork0_#t~ite54_Out1425203712|)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1425203712| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1425203712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1425203712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1425203712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1425203712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1425203712, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1425203712|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1425203712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1425203712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1425203712} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:15:57,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:15:57,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:15:57,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1990165363| |ULTIMATE.start_main_#t~ite58_Out-1990165363|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1990165363 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1990165363 256) 0))) (or (and .cse0 (= ~z~0_In-1990165363 |ULTIMATE.start_main_#t~ite58_Out-1990165363|) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out-1990165363| ~z$w_buff1~0_In-1990165363) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1990165363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990165363, ~z$w_buff1~0=~z$w_buff1~0_In-1990165363, ~z~0=~z~0_In-1990165363} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1990165363, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1990165363|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990165363, ~z$w_buff1~0=~z$w_buff1~0_In-1990165363, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1990165363|, ~z~0=~z~0_In-1990165363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:15:57,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1202563018 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1202563018 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1202563018 |ULTIMATE.start_main_#t~ite60_Out-1202563018|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1202563018|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202563018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202563018} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1202563018|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202563018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202563018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 16:15:57,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-360873661 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-360873661 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-360873661 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-360873661 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-360873661|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-360873661 |ULTIMATE.start_main_#t~ite61_Out-360873661|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360873661, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360873661, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360873661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360873661} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360873661, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-360873661|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360873661, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360873661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360873661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:15:57,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1508641631 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1508641631 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1508641631| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out1508641631| ~z$r_buff0_thd0~0_In1508641631) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1508641631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1508641631} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1508641631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1508641631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1508641631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:15:57,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2138490777 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2138490777 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2138490777 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2138490777 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-2138490777| ~z$r_buff1_thd0~0_In-2138490777) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite63_Out-2138490777| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2138490777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138490777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2138490777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2138490777} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2138490777|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2138490777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138490777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2138490777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2138490777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:15:57,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:15:57,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:15:57 BasicIcfg [2019-12-07 16:15:57,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:15:57,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:15:57,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:15:57,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:15:57,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:43" (3/4) ... [2019-12-07 16:15:57,906 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:15:57,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t53~0.base_132|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t53~0.base_132| 4) |v_#length_23|) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= (store .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132| 1) |v_#valid_167|) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t53~0.base_132|) |v_ULTIMATE.start_main_~#t53~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t53~0.base_132|)) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= 0 |v_ULTIMATE.start_main_~#t53~0.offset_73|) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_56|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_34|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ULTIMATE.start_main_~#t53~0.base=|v_ULTIMATE.start_main_~#t53~0.base_132|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ULTIMATE.start_main_~#t53~0.offset=|v_ULTIMATE.start_main_~#t53~0.offset_73|, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t55~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t55~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t53~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t54~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t54~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t53~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:57,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t54~0.base_10| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t54~0.base_10|) |v_ULTIMATE.start_main_~#t54~0.offset_9| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t54~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t54~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t54~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t54~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t54~0.offset=|v_ULTIMATE.start_main_~#t54~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t54~0.base=|v_ULTIMATE.start_main_~#t54~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t54~0.offset, #length, ULTIMATE.start_main_~#t54~0.base] because there is no mapped edge [2019-12-07 16:15:57,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t55~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t55~0.base_11|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t55~0.base_11|) |v_ULTIMATE.start_main_~#t55~0.offset_9| 2))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t55~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t55~0.base_11| 4) |v_#length_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t55~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t55~0.base=|v_ULTIMATE.start_main_~#t55~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t55~0.offset=|v_ULTIMATE.start_main_~#t55~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t55~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t55~0.offset] because there is no mapped edge [2019-12-07 16:15:57,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 16:15:57,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1303418113| |P2Thread1of1ForFork0_#t~ite28_Out-1303418113|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1303418113 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1303418113 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1303418113| ~z$w_buff0~0_In-1303418113) (not .cse0) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1303418113| ~z$w_buff1~0_In-1303418113) .cse1 (or .cse0 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1303418113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303418113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303418113, ~z$w_buff1~0=~z$w_buff1~0_In-1303418113} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1303418113|, ~z$w_buff0~0=~z$w_buff0~0_In-1303418113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303418113, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303418113, ~z$w_buff1~0=~z$w_buff1~0_In-1303418113, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1303418113|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:15:57,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:15:57,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1879585881 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1879585881| ~z$mem_tmp~0_In-1879585881)) (and .cse0 (= ~z~0_In-1879585881 |P2Thread1of1ForFork0_#t~ite48_Out-1879585881|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1879585881, ~z$flush_delayed~0=~z$flush_delayed~0_In-1879585881, ~z~0=~z~0_In-1879585881} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1879585881|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1879585881, ~z$flush_delayed~0=~z$flush_delayed~0_In-1879585881, ~z~0=~z~0_In-1879585881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 16:15:57,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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 16:15:57,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In67138005 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In67138005 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out67138005| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In67138005 |P2Thread1of1ForFork0_#t~ite51_Out67138005|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In67138005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In67138005} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In67138005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In67138005, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out67138005|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 16:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1353640172 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1353640172| ~z$mem_tmp~0_In-1353640172) (not .cse0)) (and .cse0 (= ~z~0_In-1353640172 |P1Thread1of1ForFork2_#t~ite25_Out-1353640172|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1353640172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1353640172, ~z~0=~z~0_In-1353640172} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1353640172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1353640172, ~z~0=~z~0_In-1353640172, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1353640172|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 16:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In312790601 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In312790601 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In312790601 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In312790601 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out312790601|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In312790601 |P2Thread1of1ForFork0_#t~ite52_Out312790601|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In312790601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312790601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312790601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312790601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In312790601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312790601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312790601, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out312790601|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312790601} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 16:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In981987622 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In981987622 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In981987622 ~z$r_buff0_thd3~0_Out981987622))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out981987622) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In981987622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In981987622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In981987622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out981987622, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out981987622|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 16:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1425203712 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1425203712 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1425203712 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1425203712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1425203712 |P2Thread1of1ForFork0_#t~ite54_Out1425203712|)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1425203712| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1425203712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1425203712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1425203712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1425203712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1425203712, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1425203712|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1425203712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1425203712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1425203712} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 16:15:57,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:15:57,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:15:57,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1990165363| |ULTIMATE.start_main_#t~ite58_Out-1990165363|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1990165363 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1990165363 256) 0))) (or (and .cse0 (= ~z~0_In-1990165363 |ULTIMATE.start_main_#t~ite58_Out-1990165363|) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out-1990165363| ~z$w_buff1~0_In-1990165363) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1990165363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990165363, ~z$w_buff1~0=~z$w_buff1~0_In-1990165363, ~z~0=~z~0_In-1990165363} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1990165363, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1990165363|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990165363, ~z$w_buff1~0=~z$w_buff1~0_In-1990165363, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1990165363|, ~z~0=~z~0_In-1990165363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:15:57,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1202563018 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1202563018 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1202563018 |ULTIMATE.start_main_#t~ite60_Out-1202563018|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1202563018|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202563018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202563018} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1202563018|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202563018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202563018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 16:15:57,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-360873661 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-360873661 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-360873661 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-360873661 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-360873661|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-360873661 |ULTIMATE.start_main_#t~ite61_Out-360873661|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360873661, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360873661, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360873661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360873661} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360873661, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-360873661|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360873661, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360873661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360873661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:15:57,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1508641631 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1508641631 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1508641631| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out1508641631| ~z$r_buff0_thd0~0_In1508641631) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1508641631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1508641631} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1508641631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1508641631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1508641631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:15:57,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2138490777 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2138490777 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2138490777 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2138490777 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-2138490777| ~z$r_buff1_thd0~0_In-2138490777) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite63_Out-2138490777| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2138490777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138490777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2138490777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2138490777} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2138490777|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2138490777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2138490777, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2138490777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2138490777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:15:57,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:15:57,996 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a4baf9fd-11fc-4127-9969-977744402581/bin/uautomizer/witness.graphml [2019-12-07 16:15:57,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:15:57,998 INFO L168 Benchmark]: Toolchain (without parser) took 15804.35 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 939.3 MB in the beginning and 829.4 MB in the end (delta: 110.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 16:15:57,998 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:15:57,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -95.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:57,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:15:57,999 INFO L168 Benchmark]: Boogie Preprocessor took 27.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:58,000 INFO L168 Benchmark]: RCFGBuilder took 449.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 969.0 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:58,000 INFO L168 Benchmark]: TraceAbstraction took 14792.37 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 936.4 MB). Free memory was 969.0 MB in the beginning and 858.1 MB in the end (delta: 110.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:15:58,000 INFO L168 Benchmark]: Witness Printer took 93.85 ms. Allocated memory is still 2.0 GB. Free memory was 858.1 MB in the beginning and 829.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:58,002 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -95.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 449.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 969.0 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14792.37 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 936.4 MB). Free memory was 969.0 MB in the beginning and 858.1 MB in the end (delta: 110.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 93.85 ms. Allocated memory is still 2.0 GB. Free memory was 858.1 MB in the beginning and 829.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t53, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t54, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t55, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3264 SDtfs, 3300 SDslu, 5866 SDs, 0 SdLazy, 2046 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42030occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 11954 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 290888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...