./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/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 53521bd1b8dd2f04ba27a3934c463159d55feb93 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:41:37,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:41:37,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:41:37,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:41:37,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:41:37,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:41:37,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:41:37,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:41:37,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:41:37,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:41:37,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:41:37,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:41:37,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:41:37,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:41:37,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:41:37,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:41:37,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:41:37,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:41:37,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:41:37,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:41:37,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:41:37,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:41:37,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:41:37,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:41:37,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:41:37,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:41:37,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:41:37,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:41:37,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:41:37,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:41:37,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:41:37,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:41:37,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:41:37,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:41:37,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:41:37,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:41:37,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:41:37,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:41:37,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:41:37,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:41:37,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:41:37,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:41:37,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:41:37,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:41:37,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:41:37,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:41:37,897 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:41:37,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:41:37,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:41:37,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:41:37,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:41:37,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:41:37,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:41:37,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:41:37,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:41:37,900 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_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/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 -> 53521bd1b8dd2f04ba27a3934c463159d55feb93 [2019-12-07 13:41:37,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:41:38,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:41:38,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:41:38,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:41:38,014 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:41:38,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2019-12-07 13:41:38,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/data/47faae799/7cce24e71b8d4ba8be0be79bdc70369c/FLAG406f85d0f [2019-12-07 13:41:38,482 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:41:38,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2019-12-07 13:41:38,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/data/47faae799/7cce24e71b8d4ba8be0be79bdc70369c/FLAG406f85d0f [2019-12-07 13:41:38,829 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/data/47faae799/7cce24e71b8d4ba8be0be79bdc70369c [2019-12-07 13:41:38,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:41:38,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:41:38,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:41:38,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:41:38,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:41:38,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:41:38" (1/1) ... [2019-12-07 13:41:38,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c19867b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:38, skipping insertion in model container [2019-12-07 13:41:38,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:41:38" (1/1) ... [2019-12-07 13:41:38,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:41:38,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:41:39,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:41:39,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:41:39,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:41:39,218 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:41:39,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39 WrapperNode [2019-12-07 13:41:39,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:41:39,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:41:39,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:41:39,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:41:39,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:41:39,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:41:39,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:41:39,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:41:39,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... [2019-12-07 13:41:39,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:41:39,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:41:39,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:41:39,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:41:39,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/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 13:41:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:41:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:41:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:41:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 13:41:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:41:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:41:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:41:39,332 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 13:41:39,769 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:41:39,769 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:41:39,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:41:39 BoogieIcfgContainer [2019-12-07 13:41:39,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:41:39,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:41:39,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:41:39,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:41:39,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:41:38" (1/3) ... [2019-12-07 13:41:39,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d591c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:41:39, skipping insertion in model container [2019-12-07 13:41:39,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:41:39" (2/3) ... [2019-12-07 13:41:39,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d591c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:41:39, skipping insertion in model container [2019-12-07 13:41:39,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:41:39" (3/3) ... [2019-12-07 13:41:39,774 INFO L109 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2019-12-07 13:41:39,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:41:39,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:41:39,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:41:39,786 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:41:39,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:41:39,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:41:39,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:41:39,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:41:39,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:41:39,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:41:39,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:41:39,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:41:39,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:41:39,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:41:39,882 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 293 transitions [2019-12-07 13:41:39,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 13:41:39,958 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 13:41:39,958 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:41:39,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1265 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 13:41:40,006 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 13:41:40,054 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 13:41:40,054 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:41:40,064 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1265 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 13:41:40,094 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-07 13:41:40,094 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:41:44,103 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:41:44,206 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 13:41:44,627 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134 [2019-12-07 13:41:44,818 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 13:41:44,852 INFO L206 etLargeBlockEncoding]: Checked pairs total: 167185 [2019-12-07 13:41:44,853 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-07 13:41:44,855 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 145 transitions [2019-12-07 13:42:24,006 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 215972 states. [2019-12-07 13:42:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 215972 states. [2019-12-07 13:42:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:42:24,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:42:24,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:42:24,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:42:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:42:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1275415, now seen corresponding path program 1 times [2019-12-07 13:42:24,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:42:24,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376375861] [2019-12-07 13:42:24,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:42:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:42:24,174 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 13:42:24,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376375861] [2019-12-07 13:42:24,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:42:24,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:42:24,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817191175] [2019-12-07 13:42:24,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:42:24,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:42:24,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:42:24,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:42:24,188 INFO L87 Difference]: Start difference. First operand 215972 states. Second operand 3 states. [2019-12-07 13:42:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:42:26,879 INFO L93 Difference]: Finished difference Result 214184 states and 960653 transitions. [2019-12-07 13:42:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:42:26,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:42:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:42:27,669 INFO L225 Difference]: With dead ends: 214184 [2019-12-07 13:42:27,670 INFO L226 Difference]: Without dead ends: 203875 [2019-12-07 13:42:27,671 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 13:42:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203875 states. [2019-12-07 13:42:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203875 to 203875. [2019-12-07 13:42:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203875 states. [2019-12-07 13:42:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203875 states to 203875 states and 914061 transitions. [2019-12-07 13:42:38,987 INFO L78 Accepts]: Start accepts. Automaton has 203875 states and 914061 transitions. Word has length 3 [2019-12-07 13:42:38,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:42:38,987 INFO L462 AbstractCegarLoop]: Abstraction has 203875 states and 914061 transitions. [2019-12-07 13:42:38,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:42:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 203875 states and 914061 transitions. [2019-12-07 13:42:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:42:38,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:42:38,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:42:38,996 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:42:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:42:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1408521732, now seen corresponding path program 1 times [2019-12-07 13:42:38,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:42:38,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305840628] [2019-12-07 13:42:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:42:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:42:39,070 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 13:42:39,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305840628] [2019-12-07 13:42:39,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:42:39,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:42:39,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762358019] [2019-12-07 13:42:39,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:42:39,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:42:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:42:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:42:39,072 INFO L87 Difference]: Start difference. First operand 203875 states and 914061 transitions. Second operand 4 states. [2019-12-07 13:42:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:42:40,947 INFO L93 Difference]: Finished difference Result 324533 states and 1382292 transitions. [2019-12-07 13:42:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:42:40,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:42:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:42:41,846 INFO L225 Difference]: With dead ends: 324533 [2019-12-07 13:42:41,846 INFO L226 Difference]: Without dead ends: 324484 [2019-12-07 13:42:41,847 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 13:42:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324484 states. [2019-12-07 13:42:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324484 to 303600. [2019-12-07 13:42:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303600 states. [2019-12-07 13:42:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303600 states to 303600 states and 1306247 transitions. [2019-12-07 13:42:59,172 INFO L78 Accepts]: Start accepts. Automaton has 303600 states and 1306247 transitions. Word has length 13 [2019-12-07 13:42:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:42:59,173 INFO L462 AbstractCegarLoop]: Abstraction has 303600 states and 1306247 transitions. [2019-12-07 13:42:59,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:42:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 303600 states and 1306247 transitions. [2019-12-07 13:42:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:42:59,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:42:59,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:42:59,176 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:42:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:42:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1549843844, now seen corresponding path program 1 times [2019-12-07 13:42:59,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:42:59,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152755450] [2019-12-07 13:42:59,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:42:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:42:59,240 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 13:42:59,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152755450] [2019-12-07 13:42:59,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:42:59,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:42:59,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970869881] [2019-12-07 13:42:59,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:42:59,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:42:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:42:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:42:59,241 INFO L87 Difference]: Start difference. First operand 303600 states and 1306247 transitions. Second operand 4 states. [2019-12-07 13:43:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:00,178 INFO L93 Difference]: Finished difference Result 76848 states and 273255 transitions. [2019-12-07 13:43:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:43:00,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:43:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:00,284 INFO L225 Difference]: With dead ends: 76848 [2019-12-07 13:43:00,284 INFO L226 Difference]: Without dead ends: 60146 [2019-12-07 13:43:00,284 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 13:43:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60146 states. [2019-12-07 13:43:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60146 to 60058. [2019-12-07 13:43:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60058 states. [2019-12-07 13:43:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60058 states to 60058 states and 204368 transitions. [2019-12-07 13:43:01,329 INFO L78 Accepts]: Start accepts. Automaton has 60058 states and 204368 transitions. Word has length 13 [2019-12-07 13:43:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:01,329 INFO L462 AbstractCegarLoop]: Abstraction has 60058 states and 204368 transitions. [2019-12-07 13:43:01,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 60058 states and 204368 transitions. [2019-12-07 13:43:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:43:01,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:01,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:01,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1897177656, now seen corresponding path program 1 times [2019-12-07 13:43:01,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:01,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018388712] [2019-12-07 13:43:01,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:01,397 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 13:43:01,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018388712] [2019-12-07 13:43:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:01,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:01,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645525518] [2019-12-07 13:43:01,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:01,398 INFO L87 Difference]: Start difference. First operand 60058 states and 204368 transitions. Second operand 5 states. [2019-12-07 13:43:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:01,903 INFO L93 Difference]: Finished difference Result 90882 states and 302492 transitions. [2019-12-07 13:43:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:01,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:43:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:02,046 INFO L225 Difference]: With dead ends: 90882 [2019-12-07 13:43:02,046 INFO L226 Difference]: Without dead ends: 90882 [2019-12-07 13:43:02,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90882 states. [2019-12-07 13:43:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90882 to 68374. [2019-12-07 13:43:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68374 states. [2019-12-07 13:43:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68374 states to 68374 states and 231353 transitions. [2019-12-07 13:43:03,377 INFO L78 Accepts]: Start accepts. Automaton has 68374 states and 231353 transitions. Word has length 14 [2019-12-07 13:43:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:03,377 INFO L462 AbstractCegarLoop]: Abstraction has 68374 states and 231353 transitions. [2019-12-07 13:43:03,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 68374 states and 231353 transitions. [2019-12-07 13:43:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:43:03,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:03,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:03,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1897371437, now seen corresponding path program 1 times [2019-12-07 13:43:03,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:03,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011418053] [2019-12-07 13:43:03,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:03,406 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 13:43:03,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011418053] [2019-12-07 13:43:03,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:03,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:03,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472800339] [2019-12-07 13:43:03,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:03,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:03,407 INFO L87 Difference]: Start difference. First operand 68374 states and 231353 transitions. Second operand 3 states. [2019-12-07 13:43:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:05,074 INFO L93 Difference]: Finished difference Result 88286 states and 296272 transitions. [2019-12-07 13:43:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:05,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 13:43:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:05,206 INFO L225 Difference]: With dead ends: 88286 [2019-12-07 13:43:05,206 INFO L226 Difference]: Without dead ends: 88286 [2019-12-07 13:43:05,207 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 13:43:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88286 states. [2019-12-07 13:43:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88286 to 72802. [2019-12-07 13:43:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72802 states. [2019-12-07 13:43:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72802 states to 72802 states and 247095 transitions. [2019-12-07 13:43:06,514 INFO L78 Accepts]: Start accepts. Automaton has 72802 states and 247095 transitions. Word has length 14 [2019-12-07 13:43:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:06,514 INFO L462 AbstractCegarLoop]: Abstraction has 72802 states and 247095 transitions. [2019-12-07 13:43:06,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 72802 states and 247095 transitions. [2019-12-07 13:43:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:43:06,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:06,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:06,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2089374432, now seen corresponding path program 1 times [2019-12-07 13:43:06,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:06,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607402921] [2019-12-07 13:43:06,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:06,576 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 13:43:06,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607402921] [2019-12-07 13:43:06,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:06,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:06,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803620142] [2019-12-07 13:43:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:06,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:06,577 INFO L87 Difference]: Start difference. First operand 72802 states and 247095 transitions. Second operand 5 states. [2019-12-07 13:43:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:07,052 INFO L93 Difference]: Finished difference Result 94484 states and 314683 transitions. [2019-12-07 13:43:07,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:07,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:43:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:07,203 INFO L225 Difference]: With dead ends: 94484 [2019-12-07 13:43:07,203 INFO L226 Difference]: Without dead ends: 94484 [2019-12-07 13:43:07,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94484 states. [2019-12-07 13:43:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94484 to 75797. [2019-12-07 13:43:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75797 states. [2019-12-07 13:43:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75797 states to 75797 states and 257185 transitions. [2019-12-07 13:43:08,754 INFO L78 Accepts]: Start accepts. Automaton has 75797 states and 257185 transitions. Word has length 14 [2019-12-07 13:43:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:08,754 INFO L462 AbstractCegarLoop]: Abstraction has 75797 states and 257185 transitions. [2019-12-07 13:43:08,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75797 states and 257185 transitions. [2019-12-07 13:43:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:43:08,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:08,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:08,767 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash 713848178, now seen corresponding path program 1 times [2019-12-07 13:43:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:08,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701771489] [2019-12-07 13:43:08,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:08,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 13:43:08,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701771489] [2019-12-07 13:43:08,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:08,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:08,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715031295] [2019-12-07 13:43:08,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:08,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:08,835 INFO L87 Difference]: Start difference. First operand 75797 states and 257185 transitions. Second operand 5 states. [2019-12-07 13:43:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:09,543 INFO L93 Difference]: Finished difference Result 105721 states and 350222 transitions. [2019-12-07 13:43:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:43:09,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:43:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:09,732 INFO L225 Difference]: With dead ends: 105721 [2019-12-07 13:43:09,733 INFO L226 Difference]: Without dead ends: 105665 [2019-12-07 13:43:09,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:43:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105665 states. [2019-12-07 13:43:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105665 to 76774. [2019-12-07 13:43:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76774 states. [2019-12-07 13:43:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76774 states to 76774 states and 260096 transitions. [2019-12-07 13:43:11,502 INFO L78 Accepts]: Start accepts. Automaton has 76774 states and 260096 transitions. Word has length 22 [2019-12-07 13:43:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:11,502 INFO L462 AbstractCegarLoop]: Abstraction has 76774 states and 260096 transitions. [2019-12-07 13:43:11,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76774 states and 260096 transitions. [2019-12-07 13:43:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:43:11,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:11,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:11,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash -999894054, now seen corresponding path program 1 times [2019-12-07 13:43:11,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:11,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697316188] [2019-12-07 13:43:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:11,576 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 13:43:11,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697316188] [2019-12-07 13:43:11,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:11,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000274677] [2019-12-07 13:43:11,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:11,578 INFO L87 Difference]: Start difference. First operand 76774 states and 260096 transitions. Second operand 6 states. [2019-12-07 13:43:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:12,452 INFO L93 Difference]: Finished difference Result 112565 states and 368867 transitions. [2019-12-07 13:43:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:43:12,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:43:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:12,649 INFO L225 Difference]: With dead ends: 112565 [2019-12-07 13:43:12,649 INFO L226 Difference]: Without dead ends: 112509 [2019-12-07 13:43:12,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:43:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112509 states. [2019-12-07 13:43:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112509 to 75546. [2019-12-07 13:43:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75546 states. [2019-12-07 13:43:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75546 states to 75546 states and 256004 transitions. [2019-12-07 13:43:14,235 INFO L78 Accepts]: Start accepts. Automaton has 75546 states and 256004 transitions. Word has length 22 [2019-12-07 13:43:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:14,235 INFO L462 AbstractCegarLoop]: Abstraction has 75546 states and 256004 transitions. [2019-12-07 13:43:14,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 75546 states and 256004 transitions. [2019-12-07 13:43:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:43:14,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:14,256 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] [2019-12-07 13:43:14,256 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1714881345, now seen corresponding path program 1 times [2019-12-07 13:43:14,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:14,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350775408] [2019-12-07 13:43:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:14,298 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 13:43:14,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350775408] [2019-12-07 13:43:14,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:14,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:14,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670223350] [2019-12-07 13:43:14,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:14,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:14,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:14,299 INFO L87 Difference]: Start difference. First operand 75546 states and 256004 transitions. Second operand 5 states. [2019-12-07 13:43:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:15,091 INFO L93 Difference]: Finished difference Result 108606 states and 357358 transitions. [2019-12-07 13:43:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:15,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:43:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:15,268 INFO L225 Difference]: With dead ends: 108606 [2019-12-07 13:43:15,268 INFO L226 Difference]: Without dead ends: 108593 [2019-12-07 13:43:15,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108593 states. [2019-12-07 13:43:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108593 to 89489. [2019-12-07 13:43:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89489 states. [2019-12-07 13:43:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89489 states to 89489 states and 299870 transitions. [2019-12-07 13:43:16,899 INFO L78 Accepts]: Start accepts. Automaton has 89489 states and 299870 transitions. Word has length 25 [2019-12-07 13:43:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:16,900 INFO L462 AbstractCegarLoop]: Abstraction has 89489 states and 299870 transitions. [2019-12-07 13:43:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 89489 states and 299870 transitions. [2019-12-07 13:43:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:43:16,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:16,921 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] [2019-12-07 13:43:16,921 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1974412661, now seen corresponding path program 1 times [2019-12-07 13:43:16,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:16,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666841419] [2019-12-07 13:43:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:16,945 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 13:43:16,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666841419] [2019-12-07 13:43:16,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:16,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:16,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40271239] [2019-12-07 13:43:16,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:16,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:16,946 INFO L87 Difference]: Start difference. First operand 89489 states and 299870 transitions. Second operand 3 states. [2019-12-07 13:43:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,307 INFO L93 Difference]: Finished difference Result 108698 states and 351261 transitions. [2019-12-07 13:43:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:17,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 13:43:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,485 INFO L225 Difference]: With dead ends: 108698 [2019-12-07 13:43:17,485 INFO L226 Difference]: Without dead ends: 108698 [2019-12-07 13:43:17,486 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 13:43:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108698 states. [2019-12-07 13:43:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108698 to 89115. [2019-12-07 13:43:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89115 states. [2019-12-07 13:43:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89115 states to 89115 states and 289148 transitions. [2019-12-07 13:43:19,193 INFO L78 Accepts]: Start accepts. Automaton has 89115 states and 289148 transitions. Word has length 25 [2019-12-07 13:43:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:19,193 INFO L462 AbstractCegarLoop]: Abstraction has 89115 states and 289148 transitions. [2019-12-07 13:43:19,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89115 states and 289148 transitions. [2019-12-07 13:43:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:43:19,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:19,214 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] [2019-12-07 13:43:19,214 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1187960576, now seen corresponding path program 1 times [2019-12-07 13:43:19,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:19,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168820184] [2019-12-07 13:43:19,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:19,291 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 13:43:19,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168820184] [2019-12-07 13:43:19,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:19,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:19,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345476754] [2019-12-07 13:43:19,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:19,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:19,293 INFO L87 Difference]: Start difference. First operand 89115 states and 289148 transitions. Second operand 6 states. [2019-12-07 13:43:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:19,947 INFO L93 Difference]: Finished difference Result 115019 states and 367241 transitions. [2019-12-07 13:43:19,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:43:19,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 13:43:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:20,140 INFO L225 Difference]: With dead ends: 115019 [2019-12-07 13:43:20,140 INFO L226 Difference]: Without dead ends: 114819 [2019-12-07 13:43:20,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:43:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114819 states. [2019-12-07 13:43:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114819 to 96001. [2019-12-07 13:43:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96001 states. [2019-12-07 13:43:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96001 states to 96001 states and 310379 transitions. [2019-12-07 13:43:21,997 INFO L78 Accepts]: Start accepts. Automaton has 96001 states and 310379 transitions. Word has length 25 [2019-12-07 13:43:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:21,998 INFO L462 AbstractCegarLoop]: Abstraction has 96001 states and 310379 transitions. [2019-12-07 13:43:21,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 96001 states and 310379 transitions. [2019-12-07 13:43:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:43:22,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:22,018 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] [2019-12-07 13:43:22,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash -137395498, now seen corresponding path program 1 times [2019-12-07 13:43:22,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:22,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121848661] [2019-12-07 13:43:22,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:22,070 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 13:43:22,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121848661] [2019-12-07 13:43:22,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:22,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:22,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474437121] [2019-12-07 13:43:22,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:22,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:22,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:22,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:22,071 INFO L87 Difference]: Start difference. First operand 96001 states and 310379 transitions. Second operand 5 states. [2019-12-07 13:43:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:22,852 INFO L93 Difference]: Finished difference Result 140951 states and 456463 transitions. [2019-12-07 13:43:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:22,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:43:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:23,083 INFO L225 Difference]: With dead ends: 140951 [2019-12-07 13:43:23,083 INFO L226 Difference]: Without dead ends: 140703 [2019-12-07 13:43:23,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140703 states. [2019-12-07 13:43:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140703 to 98363. [2019-12-07 13:43:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98363 states. [2019-12-07 13:43:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98363 states to 98363 states and 319081 transitions. [2019-12-07 13:43:25,430 INFO L78 Accepts]: Start accepts. Automaton has 98363 states and 319081 transitions. Word has length 26 [2019-12-07 13:43:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:25,430 INFO L462 AbstractCegarLoop]: Abstraction has 98363 states and 319081 transitions. [2019-12-07 13:43:25,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 98363 states and 319081 transitions. [2019-12-07 13:43:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:43:25,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:25,462 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] [2019-12-07 13:43:25,462 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 303744531, now seen corresponding path program 1 times [2019-12-07 13:43:25,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:25,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845954736] [2019-12-07 13:43:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:25,507 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 13:43:25,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845954736] [2019-12-07 13:43:25,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:25,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:25,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811397711] [2019-12-07 13:43:25,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:25,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:25,508 INFO L87 Difference]: Start difference. First operand 98363 states and 319081 transitions. Second operand 5 states. [2019-12-07 13:43:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:26,341 INFO L93 Difference]: Finished difference Result 134041 states and 428241 transitions. [2019-12-07 13:43:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:26,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 13:43:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:26,562 INFO L225 Difference]: With dead ends: 134041 [2019-12-07 13:43:26,562 INFO L226 Difference]: Without dead ends: 134041 [2019-12-07 13:43:26,563 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 13:43:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134041 states. [2019-12-07 13:43:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134041 to 114260. [2019-12-07 13:43:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114260 states. [2019-12-07 13:43:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114260 states to 114260 states and 369492 transitions. [2019-12-07 13:43:28,647 INFO L78 Accepts]: Start accepts. Automaton has 114260 states and 369492 transitions. Word has length 30 [2019-12-07 13:43:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:28,647 INFO L462 AbstractCegarLoop]: Abstraction has 114260 states and 369492 transitions. [2019-12-07 13:43:28,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 114260 states and 369492 transitions. [2019-12-07 13:43:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:43:28,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:28,694 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 13:43:28,695 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash -163298748, now seen corresponding path program 1 times [2019-12-07 13:43:28,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:28,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923700745] [2019-12-07 13:43:28,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:28,744 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 13:43:28,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923700745] [2019-12-07 13:43:28,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:28,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:28,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982516241] [2019-12-07 13:43:28,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:28,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:28,745 INFO L87 Difference]: Start difference. First operand 114260 states and 369492 transitions. Second operand 5 states. [2019-12-07 13:43:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:28,931 INFO L93 Difference]: Finished difference Result 53532 states and 162549 transitions. [2019-12-07 13:43:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:28,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 13:43:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:28,992 INFO L225 Difference]: With dead ends: 53532 [2019-12-07 13:43:28,992 INFO L226 Difference]: Without dead ends: 47082 [2019-12-07 13:43:28,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2019-12-07 13:43:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 43857. [2019-12-07 13:43:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43857 states. [2019-12-07 13:43:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43857 states to 43857 states and 133174 transitions. [2019-12-07 13:43:29,793 INFO L78 Accepts]: Start accepts. Automaton has 43857 states and 133174 transitions. Word has length 31 [2019-12-07 13:43:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:29,794 INFO L462 AbstractCegarLoop]: Abstraction has 43857 states and 133174 transitions. [2019-12-07 13:43:29,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 43857 states and 133174 transitions. [2019-12-07 13:43:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:43:29,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:29,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:29,827 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash 280168302, now seen corresponding path program 1 times [2019-12-07 13:43:29,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:29,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78108194] [2019-12-07 13:43:29,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:29,891 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 13:43:29,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78108194] [2019-12-07 13:43:29,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:29,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:29,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670992134] [2019-12-07 13:43:29,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:29,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:29,892 INFO L87 Difference]: Start difference. First operand 43857 states and 133174 transitions. Second operand 6 states. [2019-12-07 13:43:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:30,426 INFO L93 Difference]: Finished difference Result 53600 states and 160564 transitions. [2019-12-07 13:43:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:43:30,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:43:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:30,496 INFO L225 Difference]: With dead ends: 53600 [2019-12-07 13:43:30,496 INFO L226 Difference]: Without dead ends: 53224 [2019-12-07 13:43:30,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:43:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53224 states. [2019-12-07 13:43:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53224 to 44907. [2019-12-07 13:43:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44907 states. [2019-12-07 13:43:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44907 states to 44907 states and 136300 transitions. [2019-12-07 13:43:31,201 INFO L78 Accepts]: Start accepts. Automaton has 44907 states and 136300 transitions. Word has length 33 [2019-12-07 13:43:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:31,201 INFO L462 AbstractCegarLoop]: Abstraction has 44907 states and 136300 transitions. [2019-12-07 13:43:31,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44907 states and 136300 transitions. [2019-12-07 13:43:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:43:31,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:31,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:31,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1128266984, now seen corresponding path program 1 times [2019-12-07 13:43:31,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:31,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475169871] [2019-12-07 13:43:31,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:31,305 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 13:43:31,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475169871] [2019-12-07 13:43:31,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:31,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:31,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040043214] [2019-12-07 13:43:31,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:31,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:31,307 INFO L87 Difference]: Start difference. First operand 44907 states and 136300 transitions. Second operand 6 states. [2019-12-07 13:43:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:32,046 INFO L93 Difference]: Finished difference Result 67412 states and 201886 transitions. [2019-12-07 13:43:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:43:32,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 13:43:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:32,150 INFO L225 Difference]: With dead ends: 67412 [2019-12-07 13:43:32,150 INFO L226 Difference]: Without dead ends: 67166 [2019-12-07 13:43:32,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:43:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67166 states. [2019-12-07 13:43:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67166 to 44599. [2019-12-07 13:43:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44599 states. [2019-12-07 13:43:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44599 states to 44599 states and 135356 transitions. [2019-12-07 13:43:32,929 INFO L78 Accepts]: Start accepts. Automaton has 44599 states and 135356 transitions. Word has length 34 [2019-12-07 13:43:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:32,929 INFO L462 AbstractCegarLoop]: Abstraction has 44599 states and 135356 transitions. [2019-12-07 13:43:32,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 44599 states and 135356 transitions. [2019-12-07 13:43:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:43:32,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:32,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:32,964 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash -150966808, now seen corresponding path program 2 times [2019-12-07 13:43:32,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:32,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17912479] [2019-12-07 13:43:32,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:33,029 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 13:43:33,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17912479] [2019-12-07 13:43:33,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:33,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:33,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690818236] [2019-12-07 13:43:33,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:33,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:33,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:33,030 INFO L87 Difference]: Start difference. First operand 44599 states and 135356 transitions. Second operand 6 states. [2019-12-07 13:43:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:33,757 INFO L93 Difference]: Finished difference Result 64086 states and 190742 transitions. [2019-12-07 13:43:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:43:33,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 13:43:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:33,840 INFO L225 Difference]: With dead ends: 64086 [2019-12-07 13:43:33,840 INFO L226 Difference]: Without dead ends: 63918 [2019-12-07 13:43:33,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:43:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63918 states. [2019-12-07 13:43:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63918 to 43867. [2019-12-07 13:43:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43867 states. [2019-12-07 13:43:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43867 states to 43867 states and 133051 transitions. [2019-12-07 13:43:34,633 INFO L78 Accepts]: Start accepts. Automaton has 43867 states and 133051 transitions. Word has length 34 [2019-12-07 13:43:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:34,633 INFO L462 AbstractCegarLoop]: Abstraction has 43867 states and 133051 transitions. [2019-12-07 13:43:34,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43867 states and 133051 transitions. [2019-12-07 13:43:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:43:34,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:34,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:34,668 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2083944892, now seen corresponding path program 3 times [2019-12-07 13:43:34,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:34,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089600670] [2019-12-07 13:43:34,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:34,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 13:43:34,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089600670] [2019-12-07 13:43:34,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:34,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:34,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548649274] [2019-12-07 13:43:34,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:34,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:34,719 INFO L87 Difference]: Start difference. First operand 43867 states and 133051 transitions. Second operand 5 states. [2019-12-07 13:43:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:34,859 INFO L93 Difference]: Finished difference Result 44575 states and 134966 transitions. [2019-12-07 13:43:34,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:34,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 13:43:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:34,914 INFO L225 Difference]: With dead ends: 44575 [2019-12-07 13:43:34,914 INFO L226 Difference]: Without dead ends: 44575 [2019-12-07 13:43:34,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44575 states. [2019-12-07 13:43:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44575 to 44575. [2019-12-07 13:43:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44575 states. [2019-12-07 13:43:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44575 states to 44575 states and 134966 transitions. [2019-12-07 13:43:35,543 INFO L78 Accepts]: Start accepts. Automaton has 44575 states and 134966 transitions. Word has length 34 [2019-12-07 13:43:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:35,544 INFO L462 AbstractCegarLoop]: Abstraction has 44575 states and 134966 transitions. [2019-12-07 13:43:35,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 44575 states and 134966 transitions. [2019-12-07 13:43:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:43:35,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:35,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:35,580 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash 971574686, now seen corresponding path program 1 times [2019-12-07 13:43:35,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:35,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743160239] [2019-12-07 13:43:35,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:35,665 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 13:43:35,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743160239] [2019-12-07 13:43:35,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:35,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:43:35,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658619656] [2019-12-07 13:43:35,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:43:35,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:43:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:43:35,666 INFO L87 Difference]: Start difference. First operand 44575 states and 134966 transitions. Second operand 8 states. [2019-12-07 13:43:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:36,897 INFO L93 Difference]: Finished difference Result 102513 states and 305782 transitions. [2019-12-07 13:43:36,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:43:36,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 13:43:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:37,048 INFO L225 Difference]: With dead ends: 102513 [2019-12-07 13:43:37,048 INFO L226 Difference]: Without dead ends: 102346 [2019-12-07 13:43:37,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:43:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102346 states. [2019-12-07 13:43:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102346 to 43682. [2019-12-07 13:43:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43682 states. [2019-12-07 13:43:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43682 states to 43682 states and 132499 transitions. [2019-12-07 13:43:38,131 INFO L78 Accepts]: Start accepts. Automaton has 43682 states and 132499 transitions. Word has length 35 [2019-12-07 13:43:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:38,131 INFO L462 AbstractCegarLoop]: Abstraction has 43682 states and 132499 transitions. [2019-12-07 13:43:38,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:43:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43682 states and 132499 transitions. [2019-12-07 13:43:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:43:38,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:38,170 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] [2019-12-07 13:43:38,170 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash -390650152, now seen corresponding path program 1 times [2019-12-07 13:43:38,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:38,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124775630] [2019-12-07 13:43:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:38,224 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 13:43:38,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124775630] [2019-12-07 13:43:38,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:38,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:38,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417169488] [2019-12-07 13:43:38,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:38,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:38,225 INFO L87 Difference]: Start difference. First operand 43682 states and 132499 transitions. Second operand 6 states. [2019-12-07 13:43:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:38,380 INFO L93 Difference]: Finished difference Result 41135 states and 126525 transitions. [2019-12-07 13:43:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:38,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 13:43:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:38,431 INFO L225 Difference]: With dead ends: 41135 [2019-12-07 13:43:38,431 INFO L226 Difference]: Without dead ends: 40832 [2019-12-07 13:43:38,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:43:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40832 states. [2019-12-07 13:43:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40832 to 36568. [2019-12-07 13:43:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36568 states. [2019-12-07 13:43:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36568 states to 36568 states and 113835 transitions. [2019-12-07 13:43:39,000 INFO L78 Accepts]: Start accepts. Automaton has 36568 states and 113835 transitions. Word has length 41 [2019-12-07 13:43:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:39,001 INFO L462 AbstractCegarLoop]: Abstraction has 36568 states and 113835 transitions. [2019-12-07 13:43:39,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 36568 states and 113835 transitions. [2019-12-07 13:43:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:43:39,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:39,037 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, 1, 1, 1] [2019-12-07 13:43:39,037 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1018753019, now seen corresponding path program 1 times [2019-12-07 13:43:39,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:39,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951765987] [2019-12-07 13:43:39,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:39,063 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 13:43:39,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951765987] [2019-12-07 13:43:39,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:39,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:39,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157571340] [2019-12-07 13:43:39,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:39,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:39,065 INFO L87 Difference]: Start difference. First operand 36568 states and 113835 transitions. Second operand 3 states. [2019-12-07 13:43:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:39,302 INFO L93 Difference]: Finished difference Result 45846 states and 143028 transitions. [2019-12-07 13:43:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:39,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:43:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:39,360 INFO L225 Difference]: With dead ends: 45846 [2019-12-07 13:43:39,361 INFO L226 Difference]: Without dead ends: 45846 [2019-12-07 13:43:39,361 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 13:43:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45846 states. [2019-12-07 13:43:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45846 to 39499. [2019-12-07 13:43:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39499 states. [2019-12-07 13:43:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39499 states to 39499 states and 123140 transitions. [2019-12-07 13:43:39,990 INFO L78 Accepts]: Start accepts. Automaton has 39499 states and 123140 transitions. Word has length 66 [2019-12-07 13:43:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:39,990 INFO L462 AbstractCegarLoop]: Abstraction has 39499 states and 123140 transitions. [2019-12-07 13:43:39,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39499 states and 123140 transitions. [2019-12-07 13:43:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:43:40,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:40,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:43:40,028 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 837635465, now seen corresponding path program 2 times [2019-12-07 13:43:40,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:40,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974250319] [2019-12-07 13:43:40,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:40,069 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 13:43:40,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974250319] [2019-12-07 13:43:40,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:40,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:40,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111472223] [2019-12-07 13:43:40,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:40,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:40,070 INFO L87 Difference]: Start difference. First operand 39499 states and 123140 transitions. Second operand 3 states. [2019-12-07 13:43:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:40,227 INFO L93 Difference]: Finished difference Result 44452 states and 135185 transitions. [2019-12-07 13:43:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:40,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:43:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:40,280 INFO L225 Difference]: With dead ends: 44452 [2019-12-07 13:43:40,280 INFO L226 Difference]: Without dead ends: 44452 [2019-12-07 13:43:40,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:43:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44452 states. [2019-12-07 13:43:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44452 to 39397. [2019-12-07 13:43:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39397 states. [2019-12-07 13:43:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39397 states to 39397 states and 120423 transitions. [2019-12-07 13:43:40,897 INFO L78 Accepts]: Start accepts. Automaton has 39397 states and 120423 transitions. Word has length 66 [2019-12-07 13:43:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:40,897 INFO L462 AbstractCegarLoop]: Abstraction has 39397 states and 120423 transitions. [2019-12-07 13:43:40,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 39397 states and 120423 transitions. [2019-12-07 13:43:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:43:40,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:40,934 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, 1, 1, 1, 1] [2019-12-07 13:43:40,934 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1406210125, now seen corresponding path program 1 times [2019-12-07 13:43:40,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:40,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927455897] [2019-12-07 13:43:40,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:40,972 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 13:43:40,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927455897] [2019-12-07 13:43:40,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:40,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:40,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680795048] [2019-12-07 13:43:40,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:40,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:40,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:40,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:40,973 INFO L87 Difference]: Start difference. First operand 39397 states and 120423 transitions. Second operand 3 states. [2019-12-07 13:43:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:41,151 INFO L93 Difference]: Finished difference Result 39396 states and 120421 transitions. [2019-12-07 13:43:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:41,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 13:43:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:41,197 INFO L225 Difference]: With dead ends: 39396 [2019-12-07 13:43:41,197 INFO L226 Difference]: Without dead ends: 39396 [2019-12-07 13:43:41,197 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 13:43:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39396 states. [2019-12-07 13:43:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39396 to 39396. [2019-12-07 13:43:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39396 states. [2019-12-07 13:43:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39396 states to 39396 states and 120421 transitions. [2019-12-07 13:43:41,757 INFO L78 Accepts]: Start accepts. Automaton has 39396 states and 120421 transitions. Word has length 67 [2019-12-07 13:43:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:41,758 INFO L462 AbstractCegarLoop]: Abstraction has 39396 states and 120421 transitions. [2019-12-07 13:43:41,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 39396 states and 120421 transitions. [2019-12-07 13:43:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:43:41,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:41,794 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, 1, 1, 1, 1, 1] [2019-12-07 13:43:41,795 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 629914276, now seen corresponding path program 1 times [2019-12-07 13:43:41,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:41,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346878933] [2019-12-07 13:43:41,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:41,833 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 13:43:41,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346878933] [2019-12-07 13:43:41,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:41,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:41,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730541117] [2019-12-07 13:43:41,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:41,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:41,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:41,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:41,834 INFO L87 Difference]: Start difference. First operand 39396 states and 120421 transitions. Second operand 3 states. [2019-12-07 13:43:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:41,940 INFO L93 Difference]: Finished difference Result 39396 states and 120420 transitions. [2019-12-07 13:43:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:41,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 13:43:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:41,988 INFO L225 Difference]: With dead ends: 39396 [2019-12-07 13:43:41,989 INFO L226 Difference]: Without dead ends: 39396 [2019-12-07 13:43:41,989 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 13:43:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39396 states. [2019-12-07 13:43:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39396 to 31830. [2019-12-07 13:43:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31830 states. [2019-12-07 13:43:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31830 states to 31830 states and 98644 transitions. [2019-12-07 13:43:42,505 INFO L78 Accepts]: Start accepts. Automaton has 31830 states and 98644 transitions. Word has length 68 [2019-12-07 13:43:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:42,505 INFO L462 AbstractCegarLoop]: Abstraction has 31830 states and 98644 transitions. [2019-12-07 13:43:42,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 31830 states and 98644 transitions. [2019-12-07 13:43:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 13:43:42,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:42,539 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:42,539 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 29151004, now seen corresponding path program 1 times [2019-12-07 13:43:42,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:42,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499423737] [2019-12-07 13:43:42,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:42,579 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 13:43:42,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499423737] [2019-12-07 13:43:42,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:42,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:42,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160677084] [2019-12-07 13:43:42,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:42,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:42,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:42,580 INFO L87 Difference]: Start difference. First operand 31830 states and 98644 transitions. Second operand 3 states. [2019-12-07 13:43:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:42,672 INFO L93 Difference]: Finished difference Result 31737 states and 97086 transitions. [2019-12-07 13:43:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:42,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 13:43:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:42,711 INFO L225 Difference]: With dead ends: 31737 [2019-12-07 13:43:42,711 INFO L226 Difference]: Without dead ends: 31737 [2019-12-07 13:43:42,711 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 13:43:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31737 states. [2019-12-07 13:43:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31737 to 29845. [2019-12-07 13:43:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29845 states. [2019-12-07 13:43:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29845 states to 29845 states and 91550 transitions. [2019-12-07 13:43:43,147 INFO L78 Accepts]: Start accepts. Automaton has 29845 states and 91550 transitions. Word has length 69 [2019-12-07 13:43:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:43,147 INFO L462 AbstractCegarLoop]: Abstraction has 29845 states and 91550 transitions. [2019-12-07 13:43:43,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29845 states and 91550 transitions. [2019-12-07 13:43:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:43:43,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:43,177 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:43,177 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1894594258, now seen corresponding path program 1 times [2019-12-07 13:43:43,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:43,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139160889] [2019-12-07 13:43:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:43,231 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 13:43:43,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139160889] [2019-12-07 13:43:43,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:43,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:43,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820473076] [2019-12-07 13:43:43,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:43,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:43,232 INFO L87 Difference]: Start difference. First operand 29845 states and 91550 transitions. Second operand 5 states. [2019-12-07 13:43:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:43,414 INFO L93 Difference]: Finished difference Result 56659 states and 173104 transitions. [2019-12-07 13:43:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:43,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 13:43:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:43,453 INFO L225 Difference]: With dead ends: 56659 [2019-12-07 13:43:43,453 INFO L226 Difference]: Without dead ends: 32311 [2019-12-07 13:43:43,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:43:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32311 states. [2019-12-07 13:43:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32311 to 29839. [2019-12-07 13:43:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29839 states. [2019-12-07 13:43:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29839 states to 29839 states and 90087 transitions. [2019-12-07 13:43:43,930 INFO L78 Accepts]: Start accepts. Automaton has 29839 states and 90087 transitions. Word has length 70 [2019-12-07 13:43:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:43,930 INFO L462 AbstractCegarLoop]: Abstraction has 29839 states and 90087 transitions. [2019-12-07 13:43:43,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29839 states and 90087 transitions. [2019-12-07 13:43:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:43:43,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:43,959 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:43,960 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1719075690, now seen corresponding path program 2 times [2019-12-07 13:43:43,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:43,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32849259] [2019-12-07 13:43:43,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:44,029 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 13:43:44,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32849259] [2019-12-07 13:43:44,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:44,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:44,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068965767] [2019-12-07 13:43:44,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:44,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:44,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:44,030 INFO L87 Difference]: Start difference. First operand 29839 states and 90087 transitions. Second operand 5 states. [2019-12-07 13:43:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:44,143 INFO L93 Difference]: Finished difference Result 34956 states and 104991 transitions. [2019-12-07 13:43:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:44,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 13:43:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:44,147 INFO L225 Difference]: With dead ends: 34956 [2019-12-07 13:43:44,147 INFO L226 Difference]: Without dead ends: 3244 [2019-12-07 13:43:44,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2019-12-07 13:43:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3088. [2019-12-07 13:43:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3088 states. [2019-12-07 13:43:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 8588 transitions. [2019-12-07 13:43:44,183 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 8588 transitions. Word has length 70 [2019-12-07 13:43:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:44,184 INFO L462 AbstractCegarLoop]: Abstraction has 3088 states and 8588 transitions. [2019-12-07 13:43:44,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 8588 transitions. [2019-12-07 13:43:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:43:44,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:44,186 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:44,186 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1771400946, now seen corresponding path program 3 times [2019-12-07 13:43:44,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:44,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425269890] [2019-12-07 13:43:44,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:44,261 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 13:43:44,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425269890] [2019-12-07 13:43:44,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:44,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:44,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980644912] [2019-12-07 13:43:44,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:44,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:44,263 INFO L87 Difference]: Start difference. First operand 3088 states and 8588 transitions. Second operand 6 states. [2019-12-07 13:43:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:44,299 INFO L93 Difference]: Finished difference Result 5727 states and 16283 transitions. [2019-12-07 13:43:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:44,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 13:43:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:44,303 INFO L225 Difference]: With dead ends: 5727 [2019-12-07 13:43:44,303 INFO L226 Difference]: Without dead ends: 2764 [2019-12-07 13:43:44,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:43:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2019-12-07 13:43:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2019-12-07 13:43:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2019-12-07 13:43:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 7916 transitions. [2019-12-07 13:43:44,345 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 7916 transitions. Word has length 70 [2019-12-07 13:43:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:44,346 INFO L462 AbstractCegarLoop]: Abstraction has 2764 states and 7916 transitions. [2019-12-07 13:43:44,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 7916 transitions. [2019-12-07 13:43:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:43:44,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:44,347 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:44,348 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1279196364, now seen corresponding path program 4 times [2019-12-07 13:43:44,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:44,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778207082] [2019-12-07 13:43:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:43:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:43:44,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:43:44,437 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:43:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (let ((.cse1 (store .cse0 |v_~#x~0.base_155| 1))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_6 0) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff1~0_232) (= v_~x$w_buff0_used~0_1079 0) (< |v_#StackHeapBarrier_23| |v_~#x~0.base_155|) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= 0 v_~weak$$choice1~0_83) (= v_~__unbuffered_cnt~0_125 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46 0) (= (select .cse0 |v_~#x~0.base_155|) 0) (= 0 |v_#NULL.base_8|) (= 0 v_~x$w_buff0~0_295) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$r_buff0_thd1~0_274 0) (= |v_#valid_72| (store .cse1 |v_ULTIMATE.start_main_~#t1852~0.base_22| 1)) (= v_~x$r_buff0_thd0~0_123 0) (= v_~main$tmp_guard0~0_32 0) (= |v_#memory_int_282| (store |v_#memory_int_283| |v_ULTIMATE.start_main_~#t1852~0.base_22| (store (select |v_#memory_int_283| |v_ULTIMATE.start_main_~#t1852~0.base_22|) |v_ULTIMATE.start_main_~#t1852~0.offset_17| 0))) (= 0 v_~weak$$choice0~0_154) (= 0 v_~weak$$choice2~0_78) (= 0 v_~x$r_buff1_thd3~0_238) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_7 0) (= 0 v_~x$w_buff1_used~0_645) (= 0 v_~x$r_buff0_thd3~0_137) (= v_~x$r_buff1_thd0~0_255 0) (= 0 |v_~#x~0.offset_155|) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (< 0 |v_#StackHeapBarrier_23|) (= |v_#NULL.offset_8| 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= 0 v_~x$r_buff1_thd2~0_568) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6 0) (= v_~y~0_121 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t1852~0.base_22|) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_155| 4) |v_ULTIMATE.start_main_~#t1852~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1852~0.offset_17|) (= 0 (select (select |v_#memory_int_283| |v_~#x~0.base_155|) |v_~#x~0.offset_155|)) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_66) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p2_EAX~0_38) (= v_~x$r_buff1_thd1~0_221 0) (= 0 v_~x$r_buff0_thd2~0_531) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t1852~0.base_22|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_283|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_7|, ULTIMATE.start_main_~#t1853~0.base=|v_ULTIMATE.start_main_~#t1853~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_8|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_221, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ULTIMATE.start_main_~#t1853~0.offset=|v_ULTIMATE.start_main_~#t1853~0.offset_15|, ~weak$$choice1~0=v_~weak$$choice1~0_83, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46, #length=|v_#length_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_7, ~#x~0.offset=|v_~#x~0.offset_155|, ~x$w_buff1~0=v_~x$w_buff1~0_232, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_645, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_568, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_67|, ULTIMATE.start_main_~#t1852~0.base=|v_ULTIMATE.start_main_~#t1852~0.base_22|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_27|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_89|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_103|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_69|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_18|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_7, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_274, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_8|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_238, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ULTIMATE.start_main_~#t1854~0.offset=|v_ULTIMATE.start_main_~#t1854~0.offset_15|, ~y~0=v_~y~0_121, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_6, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_26|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_7, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_531, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_26|, #NULL.base=|v_#NULL.base_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1079, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_38|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_282|, ~#x~0.base=|v_~#x~0.base_155|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_35|, ULTIMATE.start_main_~#t1854~0.base=|v_ULTIMATE.start_main_~#t1854~0.base_19|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ULTIMATE.start_main_~#t1852~0.offset=|v_ULTIMATE.start_main_~#t1852~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ULTIMATE.start_main_~#t1853~0.base, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_~#t1853~0.offset, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_~#t1852~0.base, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t1854~0.offset, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ULTIMATE.start_main_~#t1854~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t1852~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:43:44,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L840-1-->L842: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1853~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1853~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1853~0.offset_9|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1853~0.base_11|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1853~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1853~0.base_11|)) (= (store |v_#memory_int_147| |v_ULTIMATE.start_main_~#t1853~0.base_11| (store (select |v_#memory_int_147| |v_ULTIMATE.start_main_~#t1853~0.base_11|) |v_ULTIMATE.start_main_~#t1853~0.offset_9| 1)) |v_#memory_int_146|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_147|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1853~0.offset=|v_ULTIMATE.start_main_~#t1853~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1853~0.base=|v_ULTIMATE.start_main_~#t1853~0.base_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_146|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1853~0.offset, ULTIMATE.start_main_~#t1853~0.base, ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:43:44,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1203] [1203] L842-1-->L844: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1854~0.base_11| 4) |v_#length_19|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1854~0.base_11| 1) |v_#valid_40|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1854~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1854~0.base_11| 0)) (= (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1854~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1854~0.base_11|) |v_ULTIMATE.start_main_~#t1854~0.offset_9| 2)) |v_#memory_int_156|) (= 0 |v_ULTIMATE.start_main_~#t1854~0.offset_9|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1854~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_156|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1854~0.base=|v_ULTIMATE.start_main_~#t1854~0.base_11|, ULTIMATE.start_main_~#t1854~0.offset=|v_ULTIMATE.start_main_~#t1854~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1854~0.base, ULTIMATE.start_main_~#t1854~0.offset] because there is no mapped edge [2019-12-07 13:43:44,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1230] [1230] L781-->L781-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-747582838 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-747582838| |P1Thread1of1ForFork0_#t~ite29_Out-747582838|) (= (mod ~x$w_buff0_used~0_In-747582838 256) 0) (= |P1Thread1of1ForFork0_#t~ite28_Out-747582838| ~x$w_buff0~0_In-747582838) .cse0) (and (= ~x$w_buff0~0_In-747582838 |P1Thread1of1ForFork0_#t~ite29_Out-747582838|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_In-747582838| |P1Thread1of1ForFork0_#t~ite28_Out-747582838|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-747582838, ~weak$$choice2~0=~weak$$choice2~0_In-747582838, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-747582838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-747582838} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-747582838, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-747582838|, ~weak$$choice2~0=~weak$$choice2~0_In-747582838, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-747582838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-747582838} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:43:44,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L785-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_8|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_23, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:43:44,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L790-->L797: Formula: (and (= 1 v_~y~0_7) (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 13:43:44,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] P0ENTRY-->L4-3: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_~x$w_buff0~0_59 v_~x$w_buff1~0_46) (= 1 v_~x$w_buff0_used~0_228) (= 1 v_~x$w_buff0~0_58) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_228 256))) (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_229 v_~x$w_buff1_used~0_124) (= v_~y~0_28 2) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_28, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_228} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~y~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 13:43:44,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L817-2-->L817-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out189973089| |P2Thread1of1ForFork1_#t~ite67_Out189973089|)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In189973089 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In189973089 256) 0))) (or (and (= ~x$w_buff1~0_In189973089 |P2Thread1of1ForFork1_#t~ite67_Out189973089|) (= |P2Thread1of1ForFork1_#t~mem66_In189973089| |P2Thread1of1ForFork1_#t~mem66_Out189973089|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= (select (select |#memory_int_In189973089| |~#x~0.base_In189973089|) |~#x~0.offset_In189973089|) |P2Thread1of1ForFork1_#t~mem66_Out189973089|) (= |P2Thread1of1ForFork1_#t~mem66_Out189973089| |P2Thread1of1ForFork1_#t~ite67_Out189973089|)))) InVars {~#x~0.offset=|~#x~0.offset_In189973089|, ~x$w_buff1~0=~x$w_buff1~0_In189973089, ~#x~0.base=|~#x~0.base_In189973089|, #memory_int=|#memory_int_In189973089|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189973089, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In189973089, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In189973089|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out189973089|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out189973089|, ~#x~0.offset=|~#x~0.offset_In189973089|, ~x$w_buff1~0=~x$w_buff1~0_In189973089, ~#x~0.base=|~#x~0.base_In189973089|, #memory_int=|#memory_int_In189973089|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189973089, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In189973089, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out189973089|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 13:43:44,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In408086023 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In408086023 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite61_Out408086023| |P1Thread1of1ForFork0_#t~ite60_Out408086023|))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out408086023| ~x$w_buff1~0_In408086023) .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~mem59_In408086023| |P1Thread1of1ForFork0_#t~mem59_Out408086023|)) (and (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~mem59_Out408086023| (select (select |#memory_int_In408086023| |~#x~0.base_In408086023|) |~#x~0.offset_In408086023|)) .cse0 (= |P1Thread1of1ForFork0_#t~mem59_Out408086023| |P1Thread1of1ForFork0_#t~ite60_Out408086023|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In408086023|, ~#x~0.offset=|~#x~0.offset_In408086023|, ~x$w_buff1~0=~x$w_buff1~0_In408086023, ~#x~0.base=|~#x~0.base_In408086023|, #memory_int=|#memory_int_In408086023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In408086023, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In408086023} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out408086023|, ~#x~0.offset=|~#x~0.offset_In408086023|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out408086023|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out408086023|, ~x$w_buff1~0=~x$w_buff1~0_In408086023, ~#x~0.base=|~#x~0.base_In408086023|, #memory_int=|#memory_int_In408086023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In408086023, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In408086023} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 13:43:44,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1732829407 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1732829407 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out1732829407| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out1732829407| ~x$w_buff0_used~0_In1732829407)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1732829407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1732829407} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out1732829407|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1732829407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1732829407} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 13:43:44,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In61552583 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In61552583 256) 0))) (or (and (= ~x$w_buff0_used~0_In61552583 |P2Thread1of1ForFork1_#t~ite69_Out61552583|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite69_Out61552583|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In61552583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61552583} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out61552583|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In61552583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61552583} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 13:43:44,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1784896831 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1784896831 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1784896831 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1784896831 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out1784896831|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1784896831 |P2Thread1of1ForFork1_#t~ite70_Out1784896831|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1784896831, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1784896831, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1784896831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1784896831} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1784896831, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1784896831, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1784896831, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out1784896831|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1784896831} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 13:43:44,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1178] [1178] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-280565591 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-280565591 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-280565591 |P2Thread1of1ForFork1_#t~ite71_Out-280565591|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite71_Out-280565591|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-280565591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-280565591} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-280565591|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-280565591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-280565591} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 13:43:44,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-214416715 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-214416715 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-214416715 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-214416715 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In-214416715 |P2Thread1of1ForFork1_#t~ite72_Out-214416715|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite72_Out-214416715|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-214416715, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-214416715, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-214416715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-214416715} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-214416715, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-214416715, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-214416715, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-214416715|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-214416715} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 13:43:44,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_205) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_205, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:43:44,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1946913683 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1946913683 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1946913683 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1946913683 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out1946913683|)) (and (= ~x$w_buff1_used~0_In1946913683 |P1Thread1of1ForFork0_#t~ite63_Out1946913683|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1946913683, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1946913683, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1946913683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946913683} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out1946913683|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946913683, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1946913683, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1946913683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946913683} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 13:43:44,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-499056682 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-499056682 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite64_Out-499056682| 0)) (and (= |P1Thread1of1ForFork0_#t~ite64_Out-499056682| ~x$r_buff0_thd2~0_In-499056682) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-499056682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499056682} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-499056682|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-499056682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499056682} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 13:43:44,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In860126706 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In860126706 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In860126706 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In860126706 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite65_Out860126706|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In860126706 |P1Thread1of1ForFork0_#t~ite65_Out860126706|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In860126706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860126706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860126706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860126706} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out860126706|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860126706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860126706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860126706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860126706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 13:43:44,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1211] [1211] L801-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_323 |v_P1Thread1of1ForFork0_#t~ite65_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_323, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:43:44,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-669281729 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-669281729 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out-669281729| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-669281729| ~x$w_buff0_used~0_In-669281729)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-669281729, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669281729} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-669281729, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-669281729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669281729} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 13:43:44,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-112752400 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-112752400 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-112752400 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-112752400 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out-112752400| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-112752400 |P0Thread1of1ForFork2_#t~ite7_Out-112752400|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-112752400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-112752400, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-112752400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112752400} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-112752400, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-112752400|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-112752400, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-112752400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112752400} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 13:43:44,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L764-->L765: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1891438155 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out1891438155 ~x$r_buff0_thd1~0_In1891438155)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1891438155 256)))) (or (and (= ~x$r_buff0_thd1~0_Out1891438155 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1891438155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1891438155} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1891438155, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1891438155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1891438155} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 13:43:44,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L765-->L765-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In859122526 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In859122526 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In859122526 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In859122526 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In859122526 |P0Thread1of1ForFork2_#t~ite9_Out859122526|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite9_Out859122526|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In859122526, ~x$w_buff1_used~0=~x$w_buff1_used~0_In859122526, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In859122526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859122526} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In859122526, ~x$w_buff1_used~0=~x$w_buff1_used~0_In859122526, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In859122526, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out859122526|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859122526} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:43:44,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L765-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_180) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_180, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:43:44,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_415 256) 0) (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:43:44,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1183] [1183] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite78_Out-2019337583| |ULTIMATE.start_main_#t~ite77_Out-2019337583|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2019337583 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2019337583 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~mem76_In-2019337583| |ULTIMATE.start_main_#t~mem76_Out-2019337583|) (= ~x$w_buff1~0_In-2019337583 |ULTIMATE.start_main_#t~ite77_Out-2019337583|)) (and .cse1 (= |ULTIMATE.start_main_#t~mem76_Out-2019337583| (select (select |#memory_int_In-2019337583| |~#x~0.base_In-2019337583|) |~#x~0.offset_In-2019337583|)) (= |ULTIMATE.start_main_#t~mem76_Out-2019337583| |ULTIMATE.start_main_#t~ite77_Out-2019337583|) (or .cse2 .cse0)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-2019337583|, ~#x~0.offset=|~#x~0.offset_In-2019337583|, ~x$w_buff1~0=~x$w_buff1~0_In-2019337583, ~#x~0.base=|~#x~0.base_In-2019337583|, #memory_int=|#memory_int_In-2019337583|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019337583, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2019337583} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-2019337583|, ~#x~0.offset=|~#x~0.offset_In-2019337583|, ~x$w_buff1~0=~x$w_buff1~0_In-2019337583, ~#x~0.base=|~#x~0.base_In-2019337583|, #memory_int=|#memory_int_In-2019337583|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019337583, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-2019337583|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2019337583, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-2019337583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 13:43:44,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In997109233 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In997109233 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite79_Out997109233|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In997109233 |ULTIMATE.start_main_#t~ite79_Out997109233|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In997109233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997109233} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In997109233, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out997109233|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997109233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 13:43:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1181] [1181] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In952106941 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In952106941 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In952106941 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In952106941 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite80_Out952106941|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite80_Out952106941| ~x$w_buff1_used~0_In952106941) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In952106941, ~x$w_buff1_used~0=~x$w_buff1_used~0_In952106941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In952106941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952106941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In952106941, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out952106941|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In952106941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In952106941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952106941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 13:43:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1170] [1170] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-525883537 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-525883537 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-525883537 |ULTIMATE.start_main_#t~ite81_Out-525883537|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out-525883537|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-525883537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-525883537} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-525883537, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-525883537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-525883537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 13:43:44,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1725671768 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1725671768 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1725671768 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1725671768 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite82_Out-1725671768| ~x$r_buff1_thd0~0_In-1725671768) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite82_Out-1725671768| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725671768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725671768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725671768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725671768} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725671768, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-1725671768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725671768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725671768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725671768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 13:43:44,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L858-->L858-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In-1474112058 256) 0)) (.cse1 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In-1474112058 256))))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out-1474112058| (select (select |#memory_int_In-1474112058| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058)) (= |ULTIMATE.start_main_#t~mem84_Out-1474112058| |ULTIMATE.start_main_#t~ite85_Out-1474112058|) .cse1) (and (= |ULTIMATE.start_main_#t~mem84_In-1474112058| |ULTIMATE.start_main_#t~mem84_Out-1474112058|) (= ~__unbuffered_p1_EAX~0_In-1474112058 |ULTIMATE.start_main_#t~ite85_Out-1474112058|) .cse0 .cse1))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1474112058, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058, #memory_int=|#memory_int_In-1474112058|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1474112058|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1474112058|, ~weak$$choice1~0=~weak$$choice1~0_In-1474112058, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058, #memory_int=|#memory_int_In-1474112058|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1474112058|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 13:43:44,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_12 256)) (let ((.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse1 (= 1 v_~__unbuffered_p2_EAX~0_19)) (.cse0 (= v_~__unbuffered_p2_EBX~0_19 1)) (.cse4 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_32)) (.cse5 (= v_~main$tmp_guard1~0_12 1)) (.cse2 (= v_~y~0_62 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_~main$tmp_guard1~0_12 0) .cse4) (and (not .cse3) .cse4 .cse5) (and .cse4 (not .cse1) .cse5) (and (not .cse0) .cse4 .cse5) (and .cse4 .cse5 (not .cse2))))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_62} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_62, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 13:43:44,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1198] [1198] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:43:44,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:43:44 BasicIcfg [2019-12-07 13:43:44,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:43:44,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:43:44,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:43:44,520 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:43:44,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:41:39" (3/4) ... [2019-12-07 13:43:44,521 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:43:44,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (let ((.cse1 (store .cse0 |v_~#x~0.base_155| 1))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_6 0) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff1~0_232) (= v_~x$w_buff0_used~0_1079 0) (< |v_#StackHeapBarrier_23| |v_~#x~0.base_155|) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= 0 v_~weak$$choice1~0_83) (= v_~__unbuffered_cnt~0_125 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46 0) (= (select .cse0 |v_~#x~0.base_155|) 0) (= 0 |v_#NULL.base_8|) (= 0 v_~x$w_buff0~0_295) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$r_buff0_thd1~0_274 0) (= |v_#valid_72| (store .cse1 |v_ULTIMATE.start_main_~#t1852~0.base_22| 1)) (= v_~x$r_buff0_thd0~0_123 0) (= v_~main$tmp_guard0~0_32 0) (= |v_#memory_int_282| (store |v_#memory_int_283| |v_ULTIMATE.start_main_~#t1852~0.base_22| (store (select |v_#memory_int_283| |v_ULTIMATE.start_main_~#t1852~0.base_22|) |v_ULTIMATE.start_main_~#t1852~0.offset_17| 0))) (= 0 v_~weak$$choice0~0_154) (= 0 v_~weak$$choice2~0_78) (= 0 v_~x$r_buff1_thd3~0_238) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_7 0) (= 0 v_~x$w_buff1_used~0_645) (= 0 v_~x$r_buff0_thd3~0_137) (= v_~x$r_buff1_thd0~0_255 0) (= 0 |v_~#x~0.offset_155|) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (< 0 |v_#StackHeapBarrier_23|) (= |v_#NULL.offset_8| 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= 0 v_~x$r_buff1_thd2~0_568) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6 0) (= v_~y~0_121 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t1852~0.base_22|) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_155| 4) |v_ULTIMATE.start_main_~#t1852~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1852~0.offset_17|) (= 0 (select (select |v_#memory_int_283| |v_~#x~0.base_155|) |v_~#x~0.offset_155|)) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_66) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p2_EAX~0_38) (= v_~x$r_buff1_thd1~0_221 0) (= 0 v_~x$r_buff0_thd2~0_531) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t1852~0.base_22|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_283|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_295, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_7|, ULTIMATE.start_main_~#t1853~0.base=|v_ULTIMATE.start_main_~#t1853~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_8|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_221, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ULTIMATE.start_main_~#t1853~0.offset=|v_ULTIMATE.start_main_~#t1853~0.offset_15|, ~weak$$choice1~0=v_~weak$$choice1~0_83, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_46, #length=|v_#length_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_7, ~#x~0.offset=|v_~#x~0.offset_155|, ~x$w_buff1~0=v_~x$w_buff1~0_232, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_645, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_568, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_67|, ULTIMATE.start_main_~#t1852~0.base=|v_ULTIMATE.start_main_~#t1852~0.base_22|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_27|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_89|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_103|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_69|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_18|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_7, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_274, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_8|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_238, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ULTIMATE.start_main_~#t1854~0.offset=|v_ULTIMATE.start_main_~#t1854~0.offset_15|, ~y~0=v_~y~0_121, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_6, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_26|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_7, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_531, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_26|, #NULL.base=|v_#NULL.base_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1079, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_38|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_282|, ~#x~0.base=|v_~#x~0.base_155|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_35|, ULTIMATE.start_main_~#t1854~0.base=|v_ULTIMATE.start_main_~#t1854~0.base_19|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ULTIMATE.start_main_~#t1852~0.offset=|v_ULTIMATE.start_main_~#t1852~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ULTIMATE.start_main_~#t1853~0.base, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_~#t1853~0.offset, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_~#t1852~0.base, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t1854~0.offset, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ULTIMATE.start_main_~#t1854~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t1852~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:43:44,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L840-1-->L842: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1853~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1853~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1853~0.offset_9|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1853~0.base_11|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1853~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1853~0.base_11|)) (= (store |v_#memory_int_147| |v_ULTIMATE.start_main_~#t1853~0.base_11| (store (select |v_#memory_int_147| |v_ULTIMATE.start_main_~#t1853~0.base_11|) |v_ULTIMATE.start_main_~#t1853~0.offset_9| 1)) |v_#memory_int_146|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_147|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1853~0.offset=|v_ULTIMATE.start_main_~#t1853~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1853~0.base=|v_ULTIMATE.start_main_~#t1853~0.base_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_146|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1853~0.offset, ULTIMATE.start_main_~#t1853~0.base, ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:43:44,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1203] [1203] L842-1-->L844: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1854~0.base_11| 4) |v_#length_19|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1854~0.base_11| 1) |v_#valid_40|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1854~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1854~0.base_11| 0)) (= (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1854~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1854~0.base_11|) |v_ULTIMATE.start_main_~#t1854~0.offset_9| 2)) |v_#memory_int_156|) (= 0 |v_ULTIMATE.start_main_~#t1854~0.offset_9|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1854~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_156|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1854~0.base=|v_ULTIMATE.start_main_~#t1854~0.base_11|, ULTIMATE.start_main_~#t1854~0.offset=|v_ULTIMATE.start_main_~#t1854~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1854~0.base, ULTIMATE.start_main_~#t1854~0.offset] because there is no mapped edge [2019-12-07 13:43:44,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1230] [1230] L781-->L781-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-747582838 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-747582838| |P1Thread1of1ForFork0_#t~ite29_Out-747582838|) (= (mod ~x$w_buff0_used~0_In-747582838 256) 0) (= |P1Thread1of1ForFork0_#t~ite28_Out-747582838| ~x$w_buff0~0_In-747582838) .cse0) (and (= ~x$w_buff0~0_In-747582838 |P1Thread1of1ForFork0_#t~ite29_Out-747582838|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_In-747582838| |P1Thread1of1ForFork0_#t~ite28_Out-747582838|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-747582838, ~weak$$choice2~0=~weak$$choice2~0_In-747582838, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-747582838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-747582838} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-747582838, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-747582838|, ~weak$$choice2~0=~weak$$choice2~0_In-747582838, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-747582838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-747582838} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:43:44,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L785-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_8|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_23, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:43:44,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L790-->L797: Formula: (and (= 1 v_~y~0_7) (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 13:43:44,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] P0ENTRY-->L4-3: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_~x$w_buff0~0_59 v_~x$w_buff1~0_46) (= 1 v_~x$w_buff0_used~0_228) (= 1 v_~x$w_buff0~0_58) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_228 256))) (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_229 v_~x$w_buff1_used~0_124) (= v_~y~0_28 2) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_28, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_228} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~y~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 13:43:44,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L817-2-->L817-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out189973089| |P2Thread1of1ForFork1_#t~ite67_Out189973089|)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In189973089 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In189973089 256) 0))) (or (and (= ~x$w_buff1~0_In189973089 |P2Thread1of1ForFork1_#t~ite67_Out189973089|) (= |P2Thread1of1ForFork1_#t~mem66_In189973089| |P2Thread1of1ForFork1_#t~mem66_Out189973089|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= (select (select |#memory_int_In189973089| |~#x~0.base_In189973089|) |~#x~0.offset_In189973089|) |P2Thread1of1ForFork1_#t~mem66_Out189973089|) (= |P2Thread1of1ForFork1_#t~mem66_Out189973089| |P2Thread1of1ForFork1_#t~ite67_Out189973089|)))) InVars {~#x~0.offset=|~#x~0.offset_In189973089|, ~x$w_buff1~0=~x$w_buff1~0_In189973089, ~#x~0.base=|~#x~0.base_In189973089|, #memory_int=|#memory_int_In189973089|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189973089, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In189973089, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In189973089|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out189973089|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out189973089|, ~#x~0.offset=|~#x~0.offset_In189973089|, ~x$w_buff1~0=~x$w_buff1~0_In189973089, ~#x~0.base=|~#x~0.base_In189973089|, #memory_int=|#memory_int_In189973089|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189973089, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In189973089, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out189973089|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 13:43:44,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In408086023 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In408086023 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite61_Out408086023| |P1Thread1of1ForFork0_#t~ite60_Out408086023|))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out408086023| ~x$w_buff1~0_In408086023) .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~mem59_In408086023| |P1Thread1of1ForFork0_#t~mem59_Out408086023|)) (and (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~mem59_Out408086023| (select (select |#memory_int_In408086023| |~#x~0.base_In408086023|) |~#x~0.offset_In408086023|)) .cse0 (= |P1Thread1of1ForFork0_#t~mem59_Out408086023| |P1Thread1of1ForFork0_#t~ite60_Out408086023|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In408086023|, ~#x~0.offset=|~#x~0.offset_In408086023|, ~x$w_buff1~0=~x$w_buff1~0_In408086023, ~#x~0.base=|~#x~0.base_In408086023|, #memory_int=|#memory_int_In408086023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In408086023, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In408086023} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out408086023|, ~#x~0.offset=|~#x~0.offset_In408086023|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out408086023|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out408086023|, ~x$w_buff1~0=~x$w_buff1~0_In408086023, ~#x~0.base=|~#x~0.base_In408086023|, #memory_int=|#memory_int_In408086023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In408086023, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In408086023} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 13:43:44,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1732829407 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1732829407 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out1732829407| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out1732829407| ~x$w_buff0_used~0_In1732829407)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1732829407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1732829407} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out1732829407|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1732829407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1732829407} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 13:43:44,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In61552583 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In61552583 256) 0))) (or (and (= ~x$w_buff0_used~0_In61552583 |P2Thread1of1ForFork1_#t~ite69_Out61552583|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite69_Out61552583|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In61552583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61552583} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out61552583|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In61552583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61552583} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 13:43:44,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1784896831 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1784896831 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1784896831 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1784896831 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out1784896831|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1784896831 |P2Thread1of1ForFork1_#t~ite70_Out1784896831|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1784896831, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1784896831, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1784896831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1784896831} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1784896831, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1784896831, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1784896831, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out1784896831|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1784896831} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 13:43:44,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1178] [1178] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-280565591 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-280565591 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-280565591 |P2Thread1of1ForFork1_#t~ite71_Out-280565591|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite71_Out-280565591|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-280565591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-280565591} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-280565591|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-280565591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-280565591} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 13:43:44,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-214416715 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-214416715 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-214416715 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-214416715 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In-214416715 |P2Thread1of1ForFork1_#t~ite72_Out-214416715|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite72_Out-214416715|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-214416715, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-214416715, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-214416715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-214416715} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-214416715, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-214416715, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-214416715, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-214416715|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-214416715} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 13:43:44,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_205) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_205, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:43:44,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1946913683 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1946913683 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1946913683 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1946913683 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out1946913683|)) (and (= ~x$w_buff1_used~0_In1946913683 |P1Thread1of1ForFork0_#t~ite63_Out1946913683|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1946913683, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1946913683, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1946913683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946913683} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out1946913683|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946913683, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1946913683, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1946913683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946913683} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 13:43:44,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-499056682 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-499056682 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite64_Out-499056682| 0)) (and (= |P1Thread1of1ForFork0_#t~ite64_Out-499056682| ~x$r_buff0_thd2~0_In-499056682) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-499056682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499056682} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-499056682|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-499056682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499056682} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 13:43:44,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In860126706 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In860126706 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In860126706 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In860126706 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite65_Out860126706|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In860126706 |P1Thread1of1ForFork0_#t~ite65_Out860126706|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In860126706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860126706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860126706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860126706} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out860126706|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860126706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860126706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860126706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860126706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 13:43:44,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1211] [1211] L801-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_323 |v_P1Thread1of1ForFork0_#t~ite65_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_323, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:43:44,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-669281729 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-669281729 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out-669281729| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-669281729| ~x$w_buff0_used~0_In-669281729)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-669281729, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669281729} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-669281729, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-669281729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669281729} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 13:43:44,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-112752400 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-112752400 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-112752400 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-112752400 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out-112752400| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-112752400 |P0Thread1of1ForFork2_#t~ite7_Out-112752400|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-112752400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-112752400, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-112752400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112752400} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-112752400, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-112752400|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-112752400, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-112752400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112752400} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 13:43:44,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L764-->L765: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1891438155 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out1891438155 ~x$r_buff0_thd1~0_In1891438155)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1891438155 256)))) (or (and (= ~x$r_buff0_thd1~0_Out1891438155 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1891438155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1891438155} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1891438155, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1891438155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1891438155} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 13:43:44,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L765-->L765-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In859122526 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In859122526 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In859122526 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In859122526 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In859122526 |P0Thread1of1ForFork2_#t~ite9_Out859122526|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite9_Out859122526|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In859122526, ~x$w_buff1_used~0=~x$w_buff1_used~0_In859122526, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In859122526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859122526} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In859122526, ~x$w_buff1_used~0=~x$w_buff1_used~0_In859122526, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In859122526, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out859122526|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859122526} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:43:44,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L765-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_180) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_180, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:43:44,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_415 256) 0) (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:43:44,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1183] [1183] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite78_Out-2019337583| |ULTIMATE.start_main_#t~ite77_Out-2019337583|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2019337583 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2019337583 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~mem76_In-2019337583| |ULTIMATE.start_main_#t~mem76_Out-2019337583|) (= ~x$w_buff1~0_In-2019337583 |ULTIMATE.start_main_#t~ite77_Out-2019337583|)) (and .cse1 (= |ULTIMATE.start_main_#t~mem76_Out-2019337583| (select (select |#memory_int_In-2019337583| |~#x~0.base_In-2019337583|) |~#x~0.offset_In-2019337583|)) (= |ULTIMATE.start_main_#t~mem76_Out-2019337583| |ULTIMATE.start_main_#t~ite77_Out-2019337583|) (or .cse2 .cse0)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-2019337583|, ~#x~0.offset=|~#x~0.offset_In-2019337583|, ~x$w_buff1~0=~x$w_buff1~0_In-2019337583, ~#x~0.base=|~#x~0.base_In-2019337583|, #memory_int=|#memory_int_In-2019337583|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019337583, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2019337583} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-2019337583|, ~#x~0.offset=|~#x~0.offset_In-2019337583|, ~x$w_buff1~0=~x$w_buff1~0_In-2019337583, ~#x~0.base=|~#x~0.base_In-2019337583|, #memory_int=|#memory_int_In-2019337583|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2019337583, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-2019337583|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2019337583, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-2019337583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 13:43:44,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In997109233 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In997109233 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite79_Out997109233|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In997109233 |ULTIMATE.start_main_#t~ite79_Out997109233|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In997109233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997109233} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In997109233, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out997109233|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997109233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 13:43:44,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1181] [1181] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In952106941 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In952106941 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In952106941 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In952106941 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite80_Out952106941|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite80_Out952106941| ~x$w_buff1_used~0_In952106941) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In952106941, ~x$w_buff1_used~0=~x$w_buff1_used~0_In952106941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In952106941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952106941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In952106941, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out952106941|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In952106941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In952106941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952106941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 13:43:44,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1170] [1170] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-525883537 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-525883537 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-525883537 |ULTIMATE.start_main_#t~ite81_Out-525883537|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out-525883537|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-525883537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-525883537} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-525883537, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-525883537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-525883537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 13:43:44,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1725671768 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1725671768 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1725671768 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1725671768 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite82_Out-1725671768| ~x$r_buff1_thd0~0_In-1725671768) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite82_Out-1725671768| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725671768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725671768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725671768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725671768} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725671768, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-1725671768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725671768, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725671768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725671768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 13:43:44,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L858-->L858-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In-1474112058 256) 0)) (.cse1 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In-1474112058 256))))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out-1474112058| (select (select |#memory_int_In-1474112058| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058)) (= |ULTIMATE.start_main_#t~mem84_Out-1474112058| |ULTIMATE.start_main_#t~ite85_Out-1474112058|) .cse1) (and (= |ULTIMATE.start_main_#t~mem84_In-1474112058| |ULTIMATE.start_main_#t~mem84_Out-1474112058|) (= ~__unbuffered_p1_EAX~0_In-1474112058 |ULTIMATE.start_main_#t~ite85_Out-1474112058|) .cse0 .cse1))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1474112058, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058, #memory_int=|#memory_int_In-1474112058|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1474112058|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1474112058|, ~weak$$choice1~0=~weak$$choice1~0_In-1474112058, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1474112058, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1474112058, #memory_int=|#memory_int_In-1474112058|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1474112058|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1474112058} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 13:43:44,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_12 256)) (let ((.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse1 (= 1 v_~__unbuffered_p2_EAX~0_19)) (.cse0 (= v_~__unbuffered_p2_EBX~0_19 1)) (.cse4 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_32)) (.cse5 (= v_~main$tmp_guard1~0_12 1)) (.cse2 (= v_~y~0_62 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_~main$tmp_guard1~0_12 0) .cse4) (and (not .cse3) .cse4 .cse5) (and .cse4 (not .cse1) .cse5) (and (not .cse0) .cse4 .cse5) (and .cse4 .cse5 (not .cse2))))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_62} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_62, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 13:43:44,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1198] [1198] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:43:44,601 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4696f605-ae38-43ea-a2f3-5ee62eb45b0c/bin/uautomizer/witness.graphml [2019-12-07 13:43:44,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:43:44,602 INFO L168 Benchmark]: Toolchain (without parser) took 125769.64 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 939.3 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 13:43:44,602 INFO L168 Benchmark]: CDTParser took 0.19 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 13:43:44,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:44,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:43:44,603 INFO L168 Benchmark]: Boogie Preprocessor took 28.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 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 13:43:44,603 INFO L168 Benchmark]: RCFGBuilder took 483.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 977.9 MB in the end (delta: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:44,604 INFO L168 Benchmark]: TraceAbstraction took 124748.77 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 977.9 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:43:44,604 INFO L168 Benchmark]: Witness Printer took 82.04 ms. Allocated memory is still 6.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:44,605 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.19 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 385.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 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 483.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 977.9 MB in the end (delta: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 124748.77 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 977.9 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 82.04 ms. Allocated memory is still 6.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 235 ProgramPointsBefore, 118 ProgramPointsAfterwards, 293 TransitionsBefore, 145 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 68 ConcurrentYvCompositions, 35 ChoiceCompositions, 11836 VarBasedMoverChecksPositive, 334 VarBasedMoverChecksNegative, 109 SemBasedMoverChecksPositive, 340 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 167185 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 x$flush_delayed = weak$$choice2 [L778] EXPR 2 \read(x) [L778] 2 x$mem_tmp = x [L779] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L780] EXPR 2 \read(x) [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L844] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L783] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L784] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L786] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L787] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L788] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L789] EXPR 2 \read(x) [L789] 2 __unbuffered_p1_EAX = x [L811] 3 __unbuffered_p2_EAX = y [L814] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L754] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L850] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L857] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 226 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6418 SDtfs, 8155 SDslu, 11735 SDs, 0 SdLazy, 7602 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 57 SyntacticMatches, 26 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 403707 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1104 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 143778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...