./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004_tso.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_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/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 e2130dd17ba5a3d480230707cd275ef01639aa84 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:14:47,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:14:47,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:14:47,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:14:47,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:14:47,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:14:47,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:14:47,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:14:47,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:14:47,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:14:47,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:14:47,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:14:47,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:14:47,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:14:47,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:14:47,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:14:47,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:14:47,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:14:47,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:14:47,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:14:47,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:14:47,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:14:47,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:14:47,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:14:47,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:14:47,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:14:47,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:14:47,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:14:47,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:14:47,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:14:47,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:14:47,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:14:47,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:14:47,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:14:47,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:14:47,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:14:47,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:14:47,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:14:47,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:14:47,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:14:47,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:14:47,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:14:47,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:14:47,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:14:47,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:14:47,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:14:47,830 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:14:47,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:14:47,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:14:47,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:14:47,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:14:47,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:14:47,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:14:47,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:14:47,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:14:47,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:14:47,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:14:47,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:14:47,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:14:47,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:14:47,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:14:47,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:14:47,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:14:47,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:14:47,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:14:47,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:14:47,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:14:47,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:14:47,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:14:47,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:14:47,835 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:14:47,835 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_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/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 -> e2130dd17ba5a3d480230707cd275ef01639aa84 [2019-12-07 17:14:47,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:14:47,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:14:47,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:14:47,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:14:47,949 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:14:47,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix004_tso.opt.i [2019-12-07 17:14:47,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/data/cc97299dd/c1bf1adace5b4b19b870c27eaad5494f/FLAG756c5053b [2019-12-07 17:14:48,425 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:14:48,426 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/sv-benchmarks/c/pthread-wmm/mix004_tso.opt.i [2019-12-07 17:14:48,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/data/cc97299dd/c1bf1adace5b4b19b870c27eaad5494f/FLAG756c5053b [2019-12-07 17:14:48,761 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/data/cc97299dd/c1bf1adace5b4b19b870c27eaad5494f [2019-12-07 17:14:48,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:14:48,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:14:48,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:48,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:14:48,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:14:48,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:48" (1/1) ... [2019-12-07 17:14:48,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375546ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:48, skipping insertion in model container [2019-12-07 17:14:48,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:48" (1/1) ... [2019-12-07 17:14:48,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:14:48,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:14:49,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:49,053 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:14:49,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:49,146 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:14:49,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49 WrapperNode [2019-12-07 17:14:49,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:49,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:49,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:14:49,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:14:49,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:49,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:14:49,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:14:49,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:14:49,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... [2019-12-07 17:14:49,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:14:49,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:14:49,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:14:49,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:14:49,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/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 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:14:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:14:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:14:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:14:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:14:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:14:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:14:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:14:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:14:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:14:49,263 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 17:14:49,681 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:14:49,681 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:14:49,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:49 BoogieIcfgContainer [2019-12-07 17:14:49,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:14:49,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:14:49,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:14:49,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:14:49,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:14:48" (1/3) ... [2019-12-07 17:14:49,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51384fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:49, skipping insertion in model container [2019-12-07 17:14:49,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:49" (2/3) ... [2019-12-07 17:14:49,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51384fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:49, skipping insertion in model container [2019-12-07 17:14:49,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:49" (3/3) ... [2019-12-07 17:14:49,689 INFO L109 eAbstractionObserver]: Analyzing ICFG mix004_tso.opt.i [2019-12-07 17:14:49,697 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:14:49,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:14:49,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:14:49,704 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:14:49,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,748 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,752 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,753 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,754 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:14:49,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:14:49,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:14:49,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:14:49,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:14:49,785 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:14:49,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:14:49,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:14:49,785 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:14:49,785 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:14:49,797 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 17:14:49,798 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 17:14:49,865 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 17:14:49,865 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:14:49,878 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 931 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:14:49,901 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 17:14:49,939 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 17:14:49,939 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:14:49,948 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 931 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:14:49,974 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:14:49,974 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:14:53,826 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 17:14:54,098 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 17:14:54,140 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131755 [2019-12-07 17:14:54,140 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 17:14:54,142 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 136 transitions [2019-12-07 17:15:04,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100210 states. [2019-12-07 17:15:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 100210 states. [2019-12-07 17:15:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:15:04,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:04,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:04,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1786135930, now seen corresponding path program 1 times [2019-12-07 17:15:04,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:04,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572517346] [2019-12-07 17:15:04,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:04,555 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 17:15:04,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572517346] [2019-12-07 17:15:04,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:04,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:15:04,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690276750] [2019-12-07 17:15:04,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:15:04,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:15:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:15:04,571 INFO L87 Difference]: Start difference. First operand 100210 states. Second operand 3 states. [2019-12-07 17:15:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:05,309 INFO L93 Difference]: Finished difference Result 99346 states and 455736 transitions. [2019-12-07 17:15:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:15:05,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:15:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:05,874 INFO L225 Difference]: With dead ends: 99346 [2019-12-07 17:15:05,874 INFO L226 Difference]: Without dead ends: 92982 [2019-12-07 17:15:05,875 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 17:15:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92982 states. [2019-12-07 17:15:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92982 to 92982. [2019-12-07 17:15:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92982 states. [2019-12-07 17:15:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92982 states to 92982 states and 426292 transitions. [2019-12-07 17:15:11,138 INFO L78 Accepts]: Start accepts. Automaton has 92982 states and 426292 transitions. Word has length 9 [2019-12-07 17:15:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:11,139 INFO L462 AbstractCegarLoop]: Abstraction has 92982 states and 426292 transitions. [2019-12-07 17:15:11,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:15:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 92982 states and 426292 transitions. [2019-12-07 17:15:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:15:11,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:11,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:11,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1774452864, now seen corresponding path program 1 times [2019-12-07 17:15:11,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:11,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489956015] [2019-12-07 17:15:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:11,205 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 17:15:11,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489956015] [2019-12-07 17:15:11,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:11,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980115470] [2019-12-07 17:15:11,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:15:11,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:15:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:11,208 INFO L87 Difference]: Start difference. First operand 92982 states and 426292 transitions. Second operand 4 states. [2019-12-07 17:15:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:12,173 INFO L93 Difference]: Finished difference Result 144254 states and 639260 transitions. [2019-12-07 17:15:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:15:12,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:15:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:12,599 INFO L225 Difference]: With dead ends: 144254 [2019-12-07 17:15:12,599 INFO L226 Difference]: Without dead ends: 144186 [2019-12-07 17:15:12,600 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 17:15:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144186 states. [2019-12-07 17:15:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144186 to 141118. [2019-12-07 17:15:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141118 states. [2019-12-07 17:15:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141118 states to 141118 states and 628016 transitions. [2019-12-07 17:15:17,093 INFO L78 Accepts]: Start accepts. Automaton has 141118 states and 628016 transitions. Word has length 15 [2019-12-07 17:15:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 141118 states and 628016 transitions. [2019-12-07 17:15:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:15:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 141118 states and 628016 transitions. [2019-12-07 17:15:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:15:17,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:17,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:17,101 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 206840971, now seen corresponding path program 1 times [2019-12-07 17:15:17,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:17,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519758047] [2019-12-07 17:15:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:17,155 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 17:15:17,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519758047] [2019-12-07 17:15:17,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:17,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:17,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502800418] [2019-12-07 17:15:17,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:15:17,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:15:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:17,157 INFO L87 Difference]: Start difference. First operand 141118 states and 628016 transitions. Second operand 4 states. [2019-12-07 17:15:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:19,585 INFO L93 Difference]: Finished difference Result 179838 states and 790536 transitions. [2019-12-07 17:15:19,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:15:19,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:15:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:20,101 INFO L225 Difference]: With dead ends: 179838 [2019-12-07 17:15:20,101 INFO L226 Difference]: Without dead ends: 179778 [2019-12-07 17:15:20,102 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 17:15:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179778 states. [2019-12-07 17:15:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179778 to 161538. [2019-12-07 17:15:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161538 states. [2019-12-07 17:15:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161538 states to 161538 states and 715756 transitions. [2019-12-07 17:15:25,293 INFO L78 Accepts]: Start accepts. Automaton has 161538 states and 715756 transitions. Word has length 18 [2019-12-07 17:15:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:25,293 INFO L462 AbstractCegarLoop]: Abstraction has 161538 states and 715756 transitions. [2019-12-07 17:15:25,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:15:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 161538 states and 715756 transitions. [2019-12-07 17:15:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:15:25,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:25,308 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] [2019-12-07 17:15:25,308 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -528150255, now seen corresponding path program 1 times [2019-12-07 17:15:25,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:25,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353534581] [2019-12-07 17:15:25,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:25,366 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 17:15:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353534581] [2019-12-07 17:15:25,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:25,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:25,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381573152] [2019-12-07 17:15:25,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:15:25,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:15:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:15:25,367 INFO L87 Difference]: Start difference. First operand 161538 states and 715756 transitions. Second operand 3 states. [2019-12-07 17:15:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:26,075 INFO L93 Difference]: Finished difference Result 152786 states and 669636 transitions. [2019-12-07 17:15:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:15:26,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:15:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:26,512 INFO L225 Difference]: With dead ends: 152786 [2019-12-07 17:15:26,512 INFO L226 Difference]: Without dead ends: 152786 [2019-12-07 17:15:26,512 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 17:15:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152786 states. [2019-12-07 17:15:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152786 to 152402. [2019-12-07 17:15:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152402 states. [2019-12-07 17:15:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152402 states to 152402 states and 668228 transitions. [2019-12-07 17:15:34,118 INFO L78 Accepts]: Start accepts. Automaton has 152402 states and 668228 transitions. Word has length 20 [2019-12-07 17:15:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:34,118 INFO L462 AbstractCegarLoop]: Abstraction has 152402 states and 668228 transitions. [2019-12-07 17:15:34,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:15:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 152402 states and 668228 transitions. [2019-12-07 17:15:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:15:34,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:34,127 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] [2019-12-07 17:15:34,127 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 127526733, now seen corresponding path program 1 times [2019-12-07 17:15:34,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:34,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098992107] [2019-12-07 17:15:34,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:34,164 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 17:15:34,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098992107] [2019-12-07 17:15:34,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:34,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:34,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574849425] [2019-12-07 17:15:34,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:15:34,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:15:34,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:15:34,166 INFO L87 Difference]: Start difference. First operand 152402 states and 668228 transitions. Second operand 3 states. [2019-12-07 17:15:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:34,683 INFO L93 Difference]: Finished difference Result 117830 states and 478734 transitions. [2019-12-07 17:15:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:15:34,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:15:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:34,985 INFO L225 Difference]: With dead ends: 117830 [2019-12-07 17:15:34,985 INFO L226 Difference]: Without dead ends: 117830 [2019-12-07 17:15:34,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:15:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117830 states. [2019-12-07 17:15:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117830 to 117830. [2019-12-07 17:15:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117830 states. [2019-12-07 17:15:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117830 states to 117830 states and 478734 transitions. [2019-12-07 17:15:38,191 INFO L78 Accepts]: Start accepts. Automaton has 117830 states and 478734 transitions. Word has length 20 [2019-12-07 17:15:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:38,191 INFO L462 AbstractCegarLoop]: Abstraction has 117830 states and 478734 transitions. [2019-12-07 17:15:38,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:15:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 117830 states and 478734 transitions. [2019-12-07 17:15:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:15:38,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:38,199 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] [2019-12-07 17:15:38,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash -51440026, now seen corresponding path program 1 times [2019-12-07 17:15:38,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:38,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738979039] [2019-12-07 17:15:38,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:38,258 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 17:15:38,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738979039] [2019-12-07 17:15:38,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:38,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:38,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113749631] [2019-12-07 17:15:38,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:15:38,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:15:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:38,259 INFO L87 Difference]: Start difference. First operand 117830 states and 478734 transitions. Second operand 4 states. [2019-12-07 17:15:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:38,775 INFO L93 Difference]: Finished difference Result 117706 states and 478042 transitions. [2019-12-07 17:15:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:15:38,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:15:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:39,074 INFO L225 Difference]: With dead ends: 117706 [2019-12-07 17:15:39,074 INFO L226 Difference]: Without dead ends: 117706 [2019-12-07 17:15:39,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117706 states. [2019-12-07 17:15:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117706 to 117568. [2019-12-07 17:15:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117568 states. [2019-12-07 17:15:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117568 states to 117568 states and 477722 transitions. [2019-12-07 17:15:42,400 INFO L78 Accepts]: Start accepts. Automaton has 117568 states and 477722 transitions. Word has length 21 [2019-12-07 17:15:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:42,400 INFO L462 AbstractCegarLoop]: Abstraction has 117568 states and 477722 transitions. [2019-12-07 17:15:42,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:15:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 117568 states and 477722 transitions. [2019-12-07 17:15:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:15:42,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:42,410 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 17:15:42,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1601956768, now seen corresponding path program 1 times [2019-12-07 17:15:42,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740319375] [2019-12-07 17:15:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:42,463 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 17:15:42,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740319375] [2019-12-07 17:15:42,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:42,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:42,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078918621] [2019-12-07 17:15:42,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:15:42,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:15:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:42,464 INFO L87 Difference]: Start difference. First operand 117568 states and 477722 transitions. Second operand 4 states. [2019-12-07 17:15:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:42,972 INFO L93 Difference]: Finished difference Result 110747 states and 449110 transitions. [2019-12-07 17:15:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:15:42,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 17:15:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:43,254 INFO L225 Difference]: With dead ends: 110747 [2019-12-07 17:15:43,254 INFO L226 Difference]: Without dead ends: 110747 [2019-12-07 17:15:43,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110747 states. [2019-12-07 17:15:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110747 to 110747. [2019-12-07 17:15:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110747 states. [2019-12-07 17:15:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110747 states to 110747 states and 449110 transitions. [2019-12-07 17:15:46,558 INFO L78 Accepts]: Start accepts. Automaton has 110747 states and 449110 transitions. Word has length 22 [2019-12-07 17:15:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:46,558 INFO L462 AbstractCegarLoop]: Abstraction has 110747 states and 449110 transitions. [2019-12-07 17:15:46,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:15:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 110747 states and 449110 transitions. [2019-12-07 17:15:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:15:46,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:46,578 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 17:15:46,579 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2062283682, now seen corresponding path program 1 times [2019-12-07 17:15:46,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:46,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581629394] [2019-12-07 17:15:46,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:46,620 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 17:15:46,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581629394] [2019-12-07 17:15:46,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:46,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:15:46,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763665829] [2019-12-07 17:15:46,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:15:46,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:15:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:15:46,621 INFO L87 Difference]: Start difference. First operand 110747 states and 449110 transitions. Second operand 5 states. [2019-12-07 17:15:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:47,565 INFO L93 Difference]: Finished difference Result 132180 states and 529940 transitions. [2019-12-07 17:15:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:15:47,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:15:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:47,880 INFO L225 Difference]: With dead ends: 132180 [2019-12-07 17:15:47,880 INFO L226 Difference]: Without dead ends: 132098 [2019-12-07 17:15:47,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 17:15:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132098 states. [2019-12-07 17:15:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132098 to 110294. [2019-12-07 17:15:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110294 states. [2019-12-07 17:15:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110294 states to 110294 states and 447492 transitions. [2019-12-07 17:15:51,173 INFO L78 Accepts]: Start accepts. Automaton has 110294 states and 447492 transitions. Word has length 25 [2019-12-07 17:15:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:51,173 INFO L462 AbstractCegarLoop]: Abstraction has 110294 states and 447492 transitions. [2019-12-07 17:15:51,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:15:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 110294 states and 447492 transitions. [2019-12-07 17:15:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:15:51,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:51,298 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] [2019-12-07 17:15:51,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1456697612, now seen corresponding path program 1 times [2019-12-07 17:15:51,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:51,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976805969] [2019-12-07 17:15:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:51,361 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 17:15:51,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976805969] [2019-12-07 17:15:51,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:51,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:15:51,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280869188] [2019-12-07 17:15:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:15:51,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:15:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:15:51,362 INFO L87 Difference]: Start difference. First operand 110294 states and 447492 transitions. Second operand 5 states. [2019-12-07 17:15:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:52,287 INFO L93 Difference]: Finished difference Result 168520 states and 691071 transitions. [2019-12-07 17:15:52,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:52,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 17:15:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:52,649 INFO L225 Difference]: With dead ends: 168520 [2019-12-07 17:15:52,650 INFO L226 Difference]: Without dead ends: 146690 [2019-12-07 17:15:52,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146690 states. [2019-12-07 17:15:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146690 to 146690. [2019-12-07 17:15:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146690 states. [2019-12-07 17:15:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146690 states to 146690 states and 603155 transitions. [2019-12-07 17:15:56,549 INFO L78 Accepts]: Start accepts. Automaton has 146690 states and 603155 transitions. Word has length 37 [2019-12-07 17:15:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:56,549 INFO L462 AbstractCegarLoop]: Abstraction has 146690 states and 603155 transitions. [2019-12-07 17:15:56,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:15:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 146690 states and 603155 transitions. [2019-12-07 17:15:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:15:56,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:56,713 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] [2019-12-07 17:15:56,714 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:56,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1166271996, now seen corresponding path program 2 times [2019-12-07 17:15:56,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:56,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138417938] [2019-12-07 17:15:56,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:56,814 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 17:15:56,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138417938] [2019-12-07 17:15:56,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:56,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:15:56,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941014002] [2019-12-07 17:15:56,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:15:56,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:56,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:15:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:15:56,815 INFO L87 Difference]: Start difference. First operand 146690 states and 603155 transitions. Second operand 10 states. [2019-12-07 17:15:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:59,405 INFO L93 Difference]: Finished difference Result 300383 states and 1238442 transitions. [2019-12-07 17:15:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:15:59,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-07 17:15:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:00,122 INFO L225 Difference]: With dead ends: 300383 [2019-12-07 17:16:00,122 INFO L226 Difference]: Without dead ends: 279011 [2019-12-07 17:16:00,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:16:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279011 states. [2019-12-07 17:16:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279011 to 170945. [2019-12-07 17:16:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170945 states. [2019-12-07 17:16:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170945 states to 170945 states and 703860 transitions. [2019-12-07 17:16:08,217 INFO L78 Accepts]: Start accepts. Automaton has 170945 states and 703860 transitions. Word has length 37 [2019-12-07 17:16:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:08,217 INFO L462 AbstractCegarLoop]: Abstraction has 170945 states and 703860 transitions. [2019-12-07 17:16:08,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:16:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 170945 states and 703860 transitions. [2019-12-07 17:16:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:16:08,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:08,417 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] [2019-12-07 17:16:08,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 322852790, now seen corresponding path program 3 times [2019-12-07 17:16:08,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:08,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213012344] [2019-12-07 17:16:08,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:08,531 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 17:16:08,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213012344] [2019-12-07 17:16:08,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:08,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:16:08,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517411586] [2019-12-07 17:16:08,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:16:08,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:16:08,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:08,533 INFO L87 Difference]: Start difference. First operand 170945 states and 703860 transitions. Second operand 8 states. [2019-12-07 17:16:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:10,252 INFO L93 Difference]: Finished difference Result 245942 states and 997667 transitions. [2019-12-07 17:16:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:16:10,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:16:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:10,897 INFO L225 Difference]: With dead ends: 245942 [2019-12-07 17:16:10,897 INFO L226 Difference]: Without dead ends: 245942 [2019-12-07 17:16:10,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245942 states. [2019-12-07 17:16:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245942 to 209965. [2019-12-07 17:16:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209965 states. [2019-12-07 17:16:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209965 states to 209965 states and 856512 transitions. [2019-12-07 17:16:17,262 INFO L78 Accepts]: Start accepts. Automaton has 209965 states and 856512 transitions. Word has length 37 [2019-12-07 17:16:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:17,262 INFO L462 AbstractCegarLoop]: Abstraction has 209965 states and 856512 transitions. [2019-12-07 17:16:17,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 209965 states and 856512 transitions. [2019-12-07 17:16:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:16:17,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:17,505 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] [2019-12-07 17:16:17,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1166495442, now seen corresponding path program 4 times [2019-12-07 17:16:17,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:17,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741868980] [2019-12-07 17:16:17,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:17,624 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 17:16:17,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741868980] [2019-12-07 17:16:17,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:17,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:16:17,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617203361] [2019-12-07 17:16:17,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:16:17,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:16:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:17,625 INFO L87 Difference]: Start difference. First operand 209965 states and 856512 transitions. Second operand 8 states. [2019-12-07 17:16:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:20,370 INFO L93 Difference]: Finished difference Result 365446 states and 1490023 transitions. [2019-12-07 17:16:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:16:20,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:16:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:21,263 INFO L225 Difference]: With dead ends: 365446 [2019-12-07 17:16:21,263 INFO L226 Difference]: Without dead ends: 344218 [2019-12-07 17:16:21,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344218 states. [2019-12-07 17:16:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344218 to 218494. [2019-12-07 17:16:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218494 states. [2019-12-07 17:16:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218494 states to 218494 states and 891172 transitions. [2019-12-07 17:16:31,213 INFO L78 Accepts]: Start accepts. Automaton has 218494 states and 891172 transitions. Word has length 37 [2019-12-07 17:16:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:31,213 INFO L462 AbstractCegarLoop]: Abstraction has 218494 states and 891172 transitions. [2019-12-07 17:16:31,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 218494 states and 891172 transitions. [2019-12-07 17:16:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:16:31,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:31,470 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] [2019-12-07 17:16:31,471 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash -389126318, now seen corresponding path program 5 times [2019-12-07 17:16:31,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:31,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839640455] [2019-12-07 17:16:31,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:31,583 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 17:16:31,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839640455] [2019-12-07 17:16:31,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:31,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:16:31,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983533149] [2019-12-07 17:16:31,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:16:31,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:16:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:31,584 INFO L87 Difference]: Start difference. First operand 218494 states and 891172 transitions. Second operand 8 states. [2019-12-07 17:16:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:34,156 INFO L93 Difference]: Finished difference Result 314949 states and 1280504 transitions. [2019-12-07 17:16:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:16:34,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:16:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:34,987 INFO L225 Difference]: With dead ends: 314949 [2019-12-07 17:16:34,988 INFO L226 Difference]: Without dead ends: 314949 [2019-12-07 17:16:34,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:16:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314949 states. [2019-12-07 17:16:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314949 to 218929. [2019-12-07 17:16:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218929 states. [2019-12-07 17:16:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218929 states to 218929 states and 892912 transitions. [2019-12-07 17:16:42,586 INFO L78 Accepts]: Start accepts. Automaton has 218929 states and 892912 transitions. Word has length 37 [2019-12-07 17:16:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:42,586 INFO L462 AbstractCegarLoop]: Abstraction has 218929 states and 892912 transitions. [2019-12-07 17:16:42,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 218929 states and 892912 transitions. [2019-12-07 17:16:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:16:42,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:42,830 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] [2019-12-07 17:16:42,830 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1257451996, now seen corresponding path program 6 times [2019-12-07 17:16:42,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:42,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946710819] [2019-12-07 17:16:42,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:42,923 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 17:16:42,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946710819] [2019-12-07 17:16:42,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:42,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:16:42,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821092597] [2019-12-07 17:16:42,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:16:42,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:16:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:42,924 INFO L87 Difference]: Start difference. First operand 218929 states and 892912 transitions. Second operand 8 states. [2019-12-07 17:16:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:47,510 INFO L93 Difference]: Finished difference Result 374094 states and 1523564 transitions. [2019-12-07 17:16:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:16:47,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:16:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:48,501 INFO L225 Difference]: With dead ends: 374094 [2019-12-07 17:16:48,502 INFO L226 Difference]: Without dead ends: 374094 [2019-12-07 17:16:48,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374094 states. [2019-12-07 17:16:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374094 to 266551. [2019-12-07 17:16:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266551 states. [2019-12-07 17:16:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266551 states to 266551 states and 1087227 transitions. [2019-12-07 17:16:56,793 INFO L78 Accepts]: Start accepts. Automaton has 266551 states and 1087227 transitions. Word has length 37 [2019-12-07 17:16:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:56,793 INFO L462 AbstractCegarLoop]: Abstraction has 266551 states and 1087227 transitions. [2019-12-07 17:16:56,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 266551 states and 1087227 transitions. [2019-12-07 17:16:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:16:57,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:57,098 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] [2019-12-07 17:16:57,099 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1397504232, now seen corresponding path program 7 times [2019-12-07 17:16:57,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:57,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617761421] [2019-12-07 17:16:57,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:57,204 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 17:16:57,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617761421] [2019-12-07 17:16:57,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:57,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:16:57,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226539955] [2019-12-07 17:16:57,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:57,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:57,205 INFO L87 Difference]: Start difference. First operand 266551 states and 1087227 transitions. Second operand 9 states. [2019-12-07 17:17:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:00,235 INFO L93 Difference]: Finished difference Result 387083 states and 1572556 transitions. [2019-12-07 17:17:00,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:17:00,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-07 17:17:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:01,139 INFO L225 Difference]: With dead ends: 387083 [2019-12-07 17:17:01,139 INFO L226 Difference]: Without dead ends: 363775 [2019-12-07 17:17:01,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:17:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363775 states. [2019-12-07 17:17:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363775 to 222103. [2019-12-07 17:17:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222103 states. [2019-12-07 17:17:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222103 states to 222103 states and 904712 transitions. [2019-12-07 17:17:11,450 INFO L78 Accepts]: Start accepts. Automaton has 222103 states and 904712 transitions. Word has length 37 [2019-12-07 17:17:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:11,451 INFO L462 AbstractCegarLoop]: Abstraction has 222103 states and 904712 transitions. [2019-12-07 17:17:11,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:17:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 222103 states and 904712 transitions. [2019-12-07 17:17:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:17:11,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:11,716 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] [2019-12-07 17:17:11,716 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash 360853693, now seen corresponding path program 1 times [2019-12-07 17:17:11,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:11,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437139820] [2019-12-07 17:17:11,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:11,748 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 17:17:11,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437139820] [2019-12-07 17:17:11,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:11,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:11,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710842063] [2019-12-07 17:17:11,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:11,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:11,750 INFO L87 Difference]: Start difference. First operand 222103 states and 904712 transitions. Second operand 4 states. [2019-12-07 17:17:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:12,060 INFO L93 Difference]: Finished difference Result 83967 states and 288107 transitions. [2019-12-07 17:17:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:12,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 17:17:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:12,206 INFO L225 Difference]: With dead ends: 83967 [2019-12-07 17:17:12,206 INFO L226 Difference]: Without dead ends: 83967 [2019-12-07 17:17:12,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83967 states. [2019-12-07 17:17:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83967 to 83967. [2019-12-07 17:17:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83967 states. [2019-12-07 17:17:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83967 states to 83967 states and 288107 transitions. [2019-12-07 17:17:14,176 INFO L78 Accepts]: Start accepts. Automaton has 83967 states and 288107 transitions. Word has length 38 [2019-12-07 17:17:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:14,176 INFO L462 AbstractCegarLoop]: Abstraction has 83967 states and 288107 transitions. [2019-12-07 17:17:14,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83967 states and 288107 transitions. [2019-12-07 17:17:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:17:14,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:14,259 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] [2019-12-07 17:17:14,259 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1262672038, now seen corresponding path program 1 times [2019-12-07 17:17:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:14,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872272512] [2019-12-07 17:17:14,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:14,302 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 17:17:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872272512] [2019-12-07 17:17:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:14,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:14,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214928655] [2019-12-07 17:17:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:14,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:14,303 INFO L87 Difference]: Start difference. First operand 83967 states and 288107 transitions. Second operand 4 states. [2019-12-07 17:17:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:14,844 INFO L93 Difference]: Finished difference Result 158281 states and 541258 transitions. [2019-12-07 17:17:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:14,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 17:17:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:14,998 INFO L225 Difference]: With dead ends: 158281 [2019-12-07 17:17:14,998 INFO L226 Difference]: Without dead ends: 84033 [2019-12-07 17:17:14,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 17:17:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84033 states. [2019-12-07 17:17:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84033 to 83967. [2019-12-07 17:17:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83967 states. [2019-12-07 17:17:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83967 states to 83967 states and 281284 transitions. [2019-12-07 17:17:17,086 INFO L78 Accepts]: Start accepts. Automaton has 83967 states and 281284 transitions. Word has length 39 [2019-12-07 17:17:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:17,086 INFO L462 AbstractCegarLoop]: Abstraction has 83967 states and 281284 transitions. [2019-12-07 17:17:17,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 83967 states and 281284 transitions. [2019-12-07 17:17:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:17:17,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:17,167 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] [2019-12-07 17:17:17,167 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1434440000, now seen corresponding path program 2 times [2019-12-07 17:17:17,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:17,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880282502] [2019-12-07 17:17:17,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,205 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 17:17:17,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880282502] [2019-12-07 17:17:17,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:17,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:17:17,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350825927] [2019-12-07 17:17:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:17,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:17,207 INFO L87 Difference]: Start difference. First operand 83967 states and 281284 transitions. Second operand 5 states. [2019-12-07 17:17:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:17,261 INFO L93 Difference]: Finished difference Result 12184 states and 34930 transitions. [2019-12-07 17:17:17,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:17,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 17:17:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:17,273 INFO L225 Difference]: With dead ends: 12184 [2019-12-07 17:17:17,274 INFO L226 Difference]: Without dead ends: 12184 [2019-12-07 17:17:17,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2019-12-07 17:17:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 12100. [2019-12-07 17:17:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12100 states. [2019-12-07 17:17:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12100 states to 12100 states and 34704 transitions. [2019-12-07 17:17:17,423 INFO L78 Accepts]: Start accepts. Automaton has 12100 states and 34704 transitions. Word has length 39 [2019-12-07 17:17:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:17,423 INFO L462 AbstractCegarLoop]: Abstraction has 12100 states and 34704 transitions. [2019-12-07 17:17:17,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 12100 states and 34704 transitions. [2019-12-07 17:17:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:17:17,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:17,434 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] [2019-12-07 17:17:17,434 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1885024750, now seen corresponding path program 1 times [2019-12-07 17:17:17,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:17,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142730042] [2019-12-07 17:17:17,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,495 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 17:17:17,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142730042] [2019-12-07 17:17:17,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:17,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:17,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083429150] [2019-12-07 17:17:17,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:17,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:17,496 INFO L87 Difference]: Start difference. First operand 12100 states and 34704 transitions. Second operand 4 states. [2019-12-07 17:17:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:17,567 INFO L93 Difference]: Finished difference Result 13846 states and 38670 transitions. [2019-12-07 17:17:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:17,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 17:17:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:17,583 INFO L225 Difference]: With dead ends: 13846 [2019-12-07 17:17:17,583 INFO L226 Difference]: Without dead ends: 13357 [2019-12-07 17:17:17,583 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 17:17:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2019-12-07 17:17:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 12814. [2019-12-07 17:17:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12814 states. [2019-12-07 17:17:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 36084 transitions. [2019-12-07 17:17:17,748 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 36084 transitions. Word has length 50 [2019-12-07 17:17:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:17,749 INFO L462 AbstractCegarLoop]: Abstraction has 12814 states and 36084 transitions. [2019-12-07 17:17:17,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 36084 transitions. [2019-12-07 17:17:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:17:17,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:17,761 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] [2019-12-07 17:17:17,761 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -145368000, now seen corresponding path program 2 times [2019-12-07 17:17:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:17,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234047781] [2019-12-07 17:17:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,796 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 17:17:17,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234047781] [2019-12-07 17:17:17,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:17,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:17,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088278133] [2019-12-07 17:17:17,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:17,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:17,797 INFO L87 Difference]: Start difference. First operand 12814 states and 36084 transitions. Second operand 4 states. [2019-12-07 17:17:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:17,844 INFO L93 Difference]: Finished difference Result 14307 states and 39486 transitions. [2019-12-07 17:17:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:17,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 17:17:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:17,856 INFO L225 Difference]: With dead ends: 14307 [2019-12-07 17:17:17,856 INFO L226 Difference]: Without dead ends: 10116 [2019-12-07 17:17:17,856 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 17:17:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2019-12-07 17:17:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 10104. [2019-12-07 17:17:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10104 states. [2019-12-07 17:17:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10104 states to 10104 states and 27573 transitions. [2019-12-07 17:17:17,979 INFO L78 Accepts]: Start accepts. Automaton has 10104 states and 27573 transitions. Word has length 50 [2019-12-07 17:17:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:17,980 INFO L462 AbstractCegarLoop]: Abstraction has 10104 states and 27573 transitions. [2019-12-07 17:17:17,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 10104 states and 27573 transitions. [2019-12-07 17:17:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:17:17,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:17,988 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] [2019-12-07 17:17:17,988 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -355781886, now seen corresponding path program 3 times [2019-12-07 17:17:17,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:17,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339310671] [2019-12-07 17:17:17,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:18,018 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 17:17:18,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339310671] [2019-12-07 17:17:18,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:18,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:18,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837159102] [2019-12-07 17:17:18,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:18,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:18,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:18,019 INFO L87 Difference]: Start difference. First operand 10104 states and 27573 transitions. Second operand 4 states. [2019-12-07 17:17:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:18,055 INFO L93 Difference]: Finished difference Result 14139 states and 37154 transitions. [2019-12-07 17:17:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:18,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 17:17:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:18,063 INFO L225 Difference]: With dead ends: 14139 [2019-12-07 17:17:18,064 INFO L226 Difference]: Without dead ends: 9827 [2019-12-07 17:17:18,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 17:17:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9827 states. [2019-12-07 17:17:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9827 to 9784. [2019-12-07 17:17:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9784 states. [2019-12-07 17:17:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9784 states to 9784 states and 24267 transitions. [2019-12-07 17:17:18,318 INFO L78 Accepts]: Start accepts. Automaton has 9784 states and 24267 transitions. Word has length 50 [2019-12-07 17:17:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:18,319 INFO L462 AbstractCegarLoop]: Abstraction has 9784 states and 24267 transitions. [2019-12-07 17:17:18,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9784 states and 24267 transitions. [2019-12-07 17:17:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:17:18,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:18,325 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] [2019-12-07 17:17:18,325 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2056022146, now seen corresponding path program 4 times [2019-12-07 17:17:18,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:18,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084838184] [2019-12-07 17:17:18,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:18,360 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 17:17:18,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084838184] [2019-12-07 17:17:18,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:18,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:17:18,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711311587] [2019-12-07 17:17:18,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:18,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:18,361 INFO L87 Difference]: Start difference. First operand 9784 states and 24267 transitions. Second operand 6 states. [2019-12-07 17:17:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:18,396 INFO L93 Difference]: Finished difference Result 8133 states and 20585 transitions. [2019-12-07 17:17:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:18,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-07 17:17:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:18,397 INFO L225 Difference]: With dead ends: 8133 [2019-12-07 17:17:18,397 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 17:17:18,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 17:17:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-07 17:17:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-07 17:17:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1051 transitions. [2019-12-07 17:17:18,401 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1051 transitions. Word has length 50 [2019-12-07 17:17:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:18,401 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1051 transitions. [2019-12-07 17:17:18,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1051 transitions. [2019-12-07 17:17:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:17:18,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:18,402 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 17:17:18,402 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1367329311, now seen corresponding path program 1 times [2019-12-07 17:17:18,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:18,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170567939] [2019-12-07 17:17:18,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:18,471 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 17:17:18,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170567939] [2019-12-07 17:17:18,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:17:18,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604457159] [2019-12-07 17:17:18,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:17:18,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:17:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:17:18,472 INFO L87 Difference]: Start difference. First operand 482 states and 1051 transitions. Second operand 7 states. [2019-12-07 17:17:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:18,613 INFO L93 Difference]: Finished difference Result 1026 states and 2201 transitions. [2019-12-07 17:17:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:17:18,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 17:17:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:18,614 INFO L225 Difference]: With dead ends: 1026 [2019-12-07 17:17:18,614 INFO L226 Difference]: Without dead ends: 759 [2019-12-07 17:17:18,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:17:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-07 17:17:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 553. [2019-12-07 17:17:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-12-07 17:17:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1176 transitions. [2019-12-07 17:17:18,619 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1176 transitions. Word has length 66 [2019-12-07 17:17:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:18,619 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 1176 transitions. [2019-12-07 17:17:18,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:17:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1176 transitions. [2019-12-07 17:17:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:17:18,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:18,620 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 17:17:18,620 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash -144676445, now seen corresponding path program 2 times [2019-12-07 17:17:18,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:18,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153668771] [2019-12-07 17:17:18,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:17:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:17:18,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:17:18,707 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:17:18,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_87| 0 0))) (and (= v_~z$w_buff0~0_728 0) (= v_~weak$$choice2~0_343 0) (= 0 v_~z$r_buff1_thd3~0_505) (= v_~z$w_buff1_used~0_880 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_74) (= |v_#NULL.offset_7| 0) (< 0 |v_#StackHeapBarrier_22|) (= (select .cse0 |v_ULTIMATE.start_main_~#t117~0.base_32|) 0) (= 0 |v_ULTIMATE.start_main_~#t117~0.offset_23|) (= v_~z$r_buff1_thd0~0_309 0) (= v_~__unbuffered_p2_EBX~0_114 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t117~0.base_32|) (= v_~z$w_buff1~0_467 0) (= v_~z$w_buff0_used~0_1253 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t117~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t117~0.base_32|) |v_ULTIMATE.start_main_~#t117~0.offset_23| 0)) |v_#memory_int_27|) (= v_~x~0_38 0) (= v_~main$tmp_guard1~0_61 0) (= 0 v_~__unbuffered_p1_EAX~0_78) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~__unbuffered_cnt~0_163 0) (= v_~z$r_buff0_thd1~0_82 0) (= 0 v_~z$r_buff1_thd4~0_433) (= |v_#valid_85| (store .cse0 |v_ULTIMATE.start_main_~#t117~0.base_32| 1)) (= v_~z$read_delayed~0_7 0) (= v_~a~0_31 0) (= v_~z$r_buff0_thd2~0_82 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_298) (= 0 v_~weak$$choice0~0_246) (= v_~z$r_buff1_thd1~0_208 0) (= 0 v_~z$r_buff0_thd3~0_454) (= 0 v_~__unbuffered_p3_EBX~0_70) (= v_~y~0_59 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t117~0.base_32| 4) |v_#length_31|) (= v_~z$r_buff1_thd2~0_208 0) (= v_~z$r_buff0_thd0~0_181 0) (= 0 v_~z$r_buff0_thd4~0_611) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~z~0_332 0) (= 0 v_~z$mem_tmp~0_257))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t120~0.base=|v_ULTIMATE.start_main_~#t120~0.base_19|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_208, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_31, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_74, ULTIMATE.start_main_~#t119~0.offset=|v_ULTIMATE.start_main_~#t119~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_611, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, ULTIMATE.start_main_~#t117~0.base=|v_ULTIMATE.start_main_~#t117~0.base_32|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~z$mem_tmp~0=v_~z$mem_tmp~0_257, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_880, ULTIMATE.start_main_~#t117~0.offset=|v_ULTIMATE.start_main_~#t117~0.offset_23|, ULTIMATE.start_main_~#t119~0.base=|v_ULTIMATE.start_main_~#t119~0.base_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_298, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_246, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_225|, ULTIMATE.start_main_~#t118~0.base=|v_ULTIMATE.start_main_~#t118~0.base_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_208, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_454, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, ~x~0=v_~x~0_38, ULTIMATE.start_main_~#t118~0.offset=|v_ULTIMATE.start_main_~#t118~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_433, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_467, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_309, ULTIMATE.start_main_~#t120~0.offset=|v_ULTIMATE.start_main_~#t120~0.offset_16|, ~y~0=v_~y~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1253, ~z$w_buff0~0=v_~z$w_buff0~0_728, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_505, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_70, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_332, ~weak$$choice2~0=v_~weak$$choice2~0_343, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t120~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t119~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t117~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t117~0.offset, ULTIMATE.start_main_~#t119~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t118~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t118~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t120~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:17:18,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L858-1-->L860: Formula: (and (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t118~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t118~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t118~0.base_12| 4) |v_#length_21|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t118~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t118~0.base_12|) |v_ULTIMATE.start_main_~#t118~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t118~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t118~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t118~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t118~0.base=|v_ULTIMATE.start_main_~#t118~0.base_12|, ULTIMATE.start_main_~#t118~0.offset=|v_ULTIMATE.start_main_~#t118~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t118~0.base, ULTIMATE.start_main_~#t118~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:17:18,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t119~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t119~0.base_10| 0)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t119~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t119~0.offset_9|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t119~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t119~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t119~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t119~0.base_10|) |v_ULTIMATE.start_main_~#t119~0.offset_9| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t119~0.offset=|v_ULTIMATE.start_main_~#t119~0.offset_9|, #valid=|v_#valid_39|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t119~0.base=|v_ULTIMATE.start_main_~#t119~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t119~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t119~0.base] because there is no mapped edge [2019-12-07 17:17:18,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L862-1-->L864: Formula: (and (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t120~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t120~0.offset_11| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t120~0.base_13| 4) |v_#length_23|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t120~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t120~0.base_13|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t120~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t120~0.base_13|) |v_ULTIMATE.start_main_~#t120~0.offset_11| 3))) (not (= |v_ULTIMATE.start_main_~#t120~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t120~0.base=|v_ULTIMATE.start_main_~#t120~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t120~0.offset=|v_ULTIMATE.start_main_~#t120~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t120~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t120~0.offset, #length] because there is no mapped edge [2019-12-07 17:17:18,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_8) (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_15) (= v_~z$r_buff0_thd4~0_70 1) (= v_~z$r_buff0_thd4~0_71 v_~z$r_buff1_thd4~0_39) (= v_~weak$$choice2~0_34 v_~z$flush_delayed~0_23) (= |v_P3Thread1of1ForFork3_#t~nondet27_14| v_~weak$$choice2~0_34) (= |v_P3Thread1of1ForFork3_#t~nondet26_14| v_~weak$$choice0~0_9) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_8) (= v_~z$mem_tmp~0_13 v_~z~0_35) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_30)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_14|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_71, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z~0=v_~z~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_14|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_13|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_70, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z~0=v_~z~0_35, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_13|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 17:17:18,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| |P3Thread1of1ForFork3_#t~ite29_Out1183926700|)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1183926700 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1183926700 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| ~z$w_buff0~0_In1183926700)) (and (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| ~z$w_buff1~0_In1183926700) .cse1 (or .cse0 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1183926700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1183926700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1183926700, ~z$w_buff1~0=~z$w_buff1~0_In1183926700} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1183926700|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1183926700|, ~z$w_buff0~0=~z$w_buff0~0_In1183926700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1183926700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1183926700, ~z$w_buff1~0=~z$w_buff1~0_In1183926700} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:17:18,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L825-->L826: Formula: (and (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134) (not (= (mod v_~weak$$choice2~0_81 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:18,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2055637840 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite48_Out2055637840| ~z$mem_tmp~0_In2055637840) (not .cse0)) (and (= ~z~0_In2055637840 |P3Thread1of1ForFork3_#t~ite48_Out2055637840|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2055637840, ~z$flush_delayed~0=~z$flush_delayed~0_In2055637840, ~z~0=~z~0_In2055637840} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2055637840, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out2055637840|, ~z$flush_delayed~0=~z$flush_delayed~0_In2055637840, ~z~0=~z~0_In2055637840} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 17:17:18,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_16|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x~0_25 v_~__unbuffered_p0_EAX~0_24) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_16|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_16|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_16|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_25} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_16|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, ~x~0=v_~x~0_25, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:17:18,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.offset_9 |v_P1Thread1of1ForFork1_#in~arg.offset_11|) (= v_P1Thread1of1ForFork1_~arg.base_9 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_17) (= 0 |v_P1Thread1of1ForFork1_#res.base_7|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92) (= v_~x~0_16 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_41} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_9, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_9, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~y~0=v_~y~0_41, ~x~0=v_~x~0_16, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:17:18,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2126220026 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite25_Out-2126220026| ~z~0_In-2126220026)) (and (= ~z$mem_tmp~0_In-2126220026 |P2Thread1of1ForFork2_#t~ite25_Out-2126220026|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2126220026, ~z$flush_delayed~0=~z$flush_delayed~0_In-2126220026, ~z~0=~z~0_In-2126220026} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2126220026, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-2126220026|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2126220026, ~z~0=~z~0_In-2126220026} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:17:18,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L790-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= 0 v_~z$flush_delayed~0_110) (= v_~z~0_147 |v_P2Thread1of1ForFork2_#t~ite25_50|)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_49|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~z$flush_delayed~0=v_~z$flush_delayed~0_110, ~z~0=v_~z~0_147, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:17:18,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork3_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork3_#t~ite51_Out314902365|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 17:17:18,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1525046115 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1525046115 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1525046115 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1525046115 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1525046115 |P3Thread1of1ForFork3_#t~ite52_Out-1525046115|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite52_Out-1525046115|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1525046115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525046115, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1525046115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525046115} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-1525046115|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1525046115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525046115, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1525046115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525046115} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 17:17:18,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-959921557 ~z$r_buff0_thd4~0_In-959921557)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-959921557 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-959921557 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-959921557 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-959921557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-959921557} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-959921557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-959921557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-959921557} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:18,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1581280940 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1581280940 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1581280940 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1581280940 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In1581280940 |P3Thread1of1ForFork3_#t~ite54_Out1581280940|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out1581280940|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1581280940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581280940, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1581280940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581280940} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out1581280940|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1581280940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581280940, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1581280940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581280940} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 17:17:18,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite54_42| v_~z$r_buff1_thd4~0_278) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|)) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_41|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_278, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:17:18,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L864-1-->L870: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:17:18,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L870-2-->L870-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2123410647 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2123410647 256)))) (or (and (= ~z$w_buff1~0_In-2123410647 |ULTIMATE.start_main_#t~ite59_Out-2123410647|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-2123410647 |ULTIMATE.start_main_#t~ite59_Out-2123410647|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2123410647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123410647, ~z$w_buff1~0=~z$w_buff1~0_In-2123410647, ~z~0=~z~0_In-2123410647} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2123410647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123410647, ~z$w_buff1~0=~z$w_buff1~0_In-2123410647, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2123410647|, ~z~0=~z~0_In-2123410647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:17:18,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:17:18,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-308165937 |ULTIMATE.start_main_#t~ite61_Out-308165937|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-308165937|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-308165937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:17:18,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2048732468 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2048732468 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2048732468 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In2048732468 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2048732468|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In2048732468 |ULTIMATE.start_main_#t~ite62_Out2048732468|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048732468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048732468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048732468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048732468} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2048732468|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048732468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048732468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048732468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048732468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:17:18,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2147171299 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2147171299 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out2147171299|)) (and (= |ULTIMATE.start_main_#t~ite63_Out2147171299| ~z$r_buff0_thd0~0_In2147171299) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2147171299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2147171299} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2147171299|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2147171299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2147171299} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:17:18,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L874-->L874-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In568806129 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In568806129 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In568806129 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In568806129 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out568806129|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In568806129 |ULTIMATE.start_main_#t~ite64_Out568806129|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In568806129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In568806129, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In568806129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In568806129} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In568806129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In568806129, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In568806129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In568806129, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out568806129|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:17:18,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~z$r_buff1_thd0~0_247 |v_ULTIMATE.start_main_#t~ite64_59|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_26 256)) (= v_~main$tmp_guard1~0_26 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_60 0) (= 1 v_~__unbuffered_p2_EAX~0_62) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~__unbuffered_p3_EBX~0_33) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_59|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_58|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:17:18,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:17:18 BasicIcfg [2019-12-07 17:17:18,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:17:18,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:17:18,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:17:18,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:17:18,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:49" (3/4) ... [2019-12-07 17:17:18,798 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:17:18,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_87| 0 0))) (and (= v_~z$w_buff0~0_728 0) (= v_~weak$$choice2~0_343 0) (= 0 v_~z$r_buff1_thd3~0_505) (= v_~z$w_buff1_used~0_880 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_74) (= |v_#NULL.offset_7| 0) (< 0 |v_#StackHeapBarrier_22|) (= (select .cse0 |v_ULTIMATE.start_main_~#t117~0.base_32|) 0) (= 0 |v_ULTIMATE.start_main_~#t117~0.offset_23|) (= v_~z$r_buff1_thd0~0_309 0) (= v_~__unbuffered_p2_EBX~0_114 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t117~0.base_32|) (= v_~z$w_buff1~0_467 0) (= v_~z$w_buff0_used~0_1253 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t117~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t117~0.base_32|) |v_ULTIMATE.start_main_~#t117~0.offset_23| 0)) |v_#memory_int_27|) (= v_~x~0_38 0) (= v_~main$tmp_guard1~0_61 0) (= 0 v_~__unbuffered_p1_EAX~0_78) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~__unbuffered_cnt~0_163 0) (= v_~z$r_buff0_thd1~0_82 0) (= 0 v_~z$r_buff1_thd4~0_433) (= |v_#valid_85| (store .cse0 |v_ULTIMATE.start_main_~#t117~0.base_32| 1)) (= v_~z$read_delayed~0_7 0) (= v_~a~0_31 0) (= v_~z$r_buff0_thd2~0_82 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_298) (= 0 v_~weak$$choice0~0_246) (= v_~z$r_buff1_thd1~0_208 0) (= 0 v_~z$r_buff0_thd3~0_454) (= 0 v_~__unbuffered_p3_EBX~0_70) (= v_~y~0_59 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t117~0.base_32| 4) |v_#length_31|) (= v_~z$r_buff1_thd2~0_208 0) (= v_~z$r_buff0_thd0~0_181 0) (= 0 v_~z$r_buff0_thd4~0_611) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~z~0_332 0) (= 0 v_~z$mem_tmp~0_257))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t120~0.base=|v_ULTIMATE.start_main_~#t120~0.base_19|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_208, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_31, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_74, ULTIMATE.start_main_~#t119~0.offset=|v_ULTIMATE.start_main_~#t119~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_611, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, ULTIMATE.start_main_~#t117~0.base=|v_ULTIMATE.start_main_~#t117~0.base_32|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~z$mem_tmp~0=v_~z$mem_tmp~0_257, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_880, ULTIMATE.start_main_~#t117~0.offset=|v_ULTIMATE.start_main_~#t117~0.offset_23|, ULTIMATE.start_main_~#t119~0.base=|v_ULTIMATE.start_main_~#t119~0.base_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_298, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_246, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_225|, ULTIMATE.start_main_~#t118~0.base=|v_ULTIMATE.start_main_~#t118~0.base_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_208, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_454, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, ~x~0=v_~x~0_38, ULTIMATE.start_main_~#t118~0.offset=|v_ULTIMATE.start_main_~#t118~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_433, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_467, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_309, ULTIMATE.start_main_~#t120~0.offset=|v_ULTIMATE.start_main_~#t120~0.offset_16|, ~y~0=v_~y~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1253, ~z$w_buff0~0=v_~z$w_buff0~0_728, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_505, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_70, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_332, ~weak$$choice2~0=v_~weak$$choice2~0_343, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t120~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t119~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t117~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t117~0.offset, ULTIMATE.start_main_~#t119~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t118~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t118~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t120~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:17:18,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L858-1-->L860: Formula: (and (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t118~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t118~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t118~0.base_12| 4) |v_#length_21|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t118~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t118~0.base_12|) |v_ULTIMATE.start_main_~#t118~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t118~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t118~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t118~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t118~0.base=|v_ULTIMATE.start_main_~#t118~0.base_12|, ULTIMATE.start_main_~#t118~0.offset=|v_ULTIMATE.start_main_~#t118~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t118~0.base, ULTIMATE.start_main_~#t118~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:17:18,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t119~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t119~0.base_10| 0)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t119~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t119~0.offset_9|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t119~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t119~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t119~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t119~0.base_10|) |v_ULTIMATE.start_main_~#t119~0.offset_9| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t119~0.offset=|v_ULTIMATE.start_main_~#t119~0.offset_9|, #valid=|v_#valid_39|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t119~0.base=|v_ULTIMATE.start_main_~#t119~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t119~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t119~0.base] because there is no mapped edge [2019-12-07 17:17:18,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L862-1-->L864: Formula: (and (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t120~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t120~0.offset_11| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t120~0.base_13| 4) |v_#length_23|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t120~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t120~0.base_13|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t120~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t120~0.base_13|) |v_ULTIMATE.start_main_~#t120~0.offset_11| 3))) (not (= |v_ULTIMATE.start_main_~#t120~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t120~0.base=|v_ULTIMATE.start_main_~#t120~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t120~0.offset=|v_ULTIMATE.start_main_~#t120~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t120~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t120~0.offset, #length] because there is no mapped edge [2019-12-07 17:17:18,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_8) (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_15) (= v_~z$r_buff0_thd4~0_70 1) (= v_~z$r_buff0_thd4~0_71 v_~z$r_buff1_thd4~0_39) (= v_~weak$$choice2~0_34 v_~z$flush_delayed~0_23) (= |v_P3Thread1of1ForFork3_#t~nondet27_14| v_~weak$$choice2~0_34) (= |v_P3Thread1of1ForFork3_#t~nondet26_14| v_~weak$$choice0~0_9) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_8) (= v_~z$mem_tmp~0_13 v_~z~0_35) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_30)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_14|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_71, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z~0=v_~z~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_14|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_13|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_10, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_70, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z~0=v_~z~0_35, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_13|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 17:17:18,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| |P3Thread1of1ForFork3_#t~ite29_Out1183926700|)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1183926700 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1183926700 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| ~z$w_buff0~0_In1183926700)) (and (= |P3Thread1of1ForFork3_#t~ite28_Out1183926700| ~z$w_buff1~0_In1183926700) .cse1 (or .cse0 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1183926700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1183926700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1183926700, ~z$w_buff1~0=~z$w_buff1~0_In1183926700} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1183926700|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1183926700|, ~z$w_buff0~0=~z$w_buff0~0_In1183926700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1183926700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1183926700, ~z$w_buff1~0=~z$w_buff1~0_In1183926700} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:17:18,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L825-->L826: Formula: (and (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134) (not (= (mod v_~weak$$choice2~0_81 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:18,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2055637840 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite48_Out2055637840| ~z$mem_tmp~0_In2055637840) (not .cse0)) (and (= ~z~0_In2055637840 |P3Thread1of1ForFork3_#t~ite48_Out2055637840|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2055637840, ~z$flush_delayed~0=~z$flush_delayed~0_In2055637840, ~z~0=~z~0_In2055637840} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2055637840, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out2055637840|, ~z$flush_delayed~0=~z$flush_delayed~0_In2055637840, ~z~0=~z~0_In2055637840} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 17:17:18,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_16|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x~0_25 v_~__unbuffered_p0_EAX~0_24) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_16|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_16|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_16|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_25} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_16|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, ~x~0=v_~x~0_25, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:17:18,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.offset_9 |v_P1Thread1of1ForFork1_#in~arg.offset_11|) (= v_P1Thread1of1ForFork1_~arg.base_9 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_17) (= 0 |v_P1Thread1of1ForFork1_#res.base_7|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92) (= v_~x~0_16 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_41} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_9, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_9, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~y~0=v_~y~0_41, ~x~0=v_~x~0_16, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:17:18,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2126220026 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite25_Out-2126220026| ~z~0_In-2126220026)) (and (= ~z$mem_tmp~0_In-2126220026 |P2Thread1of1ForFork2_#t~ite25_Out-2126220026|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2126220026, ~z$flush_delayed~0=~z$flush_delayed~0_In-2126220026, ~z~0=~z~0_In-2126220026} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2126220026, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-2126220026|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2126220026, ~z~0=~z~0_In-2126220026} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:17:18,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L790-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= 0 v_~z$flush_delayed~0_110) (= v_~z~0_147 |v_P2Thread1of1ForFork2_#t~ite25_50|)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_49|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~z$flush_delayed~0=v_~z$flush_delayed~0_110, ~z~0=v_~z~0_147, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:17:18,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork3_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork3_#t~ite51_Out314902365|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 17:17:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1525046115 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1525046115 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1525046115 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1525046115 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1525046115 |P3Thread1of1ForFork3_#t~ite52_Out-1525046115|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite52_Out-1525046115|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1525046115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525046115, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1525046115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525046115} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-1525046115|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1525046115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525046115, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1525046115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525046115} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 17:17:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-959921557 ~z$r_buff0_thd4~0_In-959921557)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-959921557 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-959921557 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-959921557 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-959921557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-959921557} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-959921557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-959921557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-959921557} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1581280940 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1581280940 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1581280940 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1581280940 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In1581280940 |P3Thread1of1ForFork3_#t~ite54_Out1581280940|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out1581280940|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1581280940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581280940, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1581280940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581280940} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out1581280940|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1581280940, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581280940, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1581280940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581280940} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 17:17:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite54_42| v_~z$r_buff1_thd4~0_278) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|)) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_41|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_278, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:17:18,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L864-1-->L870: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:17:18,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L870-2-->L870-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2123410647 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2123410647 256)))) (or (and (= ~z$w_buff1~0_In-2123410647 |ULTIMATE.start_main_#t~ite59_Out-2123410647|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-2123410647 |ULTIMATE.start_main_#t~ite59_Out-2123410647|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2123410647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123410647, ~z$w_buff1~0=~z$w_buff1~0_In-2123410647, ~z~0=~z~0_In-2123410647} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2123410647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123410647, ~z$w_buff1~0=~z$w_buff1~0_In-2123410647, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2123410647|, ~z~0=~z~0_In-2123410647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:17:18,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:17:18,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-308165937 |ULTIMATE.start_main_#t~ite61_Out-308165937|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-308165937|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-308165937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:17:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2048732468 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2048732468 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2048732468 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In2048732468 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2048732468|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In2048732468 |ULTIMATE.start_main_#t~ite62_Out2048732468|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048732468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048732468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048732468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048732468} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2048732468|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2048732468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2048732468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2048732468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2048732468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:17:18,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2147171299 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2147171299 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out2147171299|)) (and (= |ULTIMATE.start_main_#t~ite63_Out2147171299| ~z$r_buff0_thd0~0_In2147171299) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2147171299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2147171299} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2147171299|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2147171299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2147171299} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:17:18,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L874-->L874-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In568806129 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In568806129 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In568806129 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In568806129 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out568806129|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In568806129 |ULTIMATE.start_main_#t~ite64_Out568806129|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In568806129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In568806129, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In568806129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In568806129} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In568806129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In568806129, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In568806129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In568806129, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out568806129|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:17:18,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~z$r_buff1_thd0~0_247 |v_ULTIMATE.start_main_#t~ite64_59|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_26 256)) (= v_~main$tmp_guard1~0_26 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_60 0) (= 1 v_~__unbuffered_p2_EAX~0_62) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~__unbuffered_p3_EBX~0_33) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_59|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_58|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:17:18,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_52a7faa4-467f-4df7-9e9d-f9f3a0fd4d1c/bin/uautomizer/witness.graphml [2019-12-07 17:17:18,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:17:18,885 INFO L168 Benchmark]: Toolchain (without parser) took 150120.97 ms. Allocated memory was 1.0 GB in the beginning and 8.7 GB in the end (delta: 7.7 GB). Free memory was 938.2 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,885 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:17:18,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.35 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 17:17:18,886 INFO L168 Benchmark]: Boogie Preprocessor took 28.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,886 INFO L168 Benchmark]: RCFGBuilder took 465.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,886 INFO L168 Benchmark]: TraceAbstraction took 149112.12 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 GB). Free memory was 996.5 MB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,887 INFO L168 Benchmark]: Witness Printer took 88.21 ms. Allocated memory is still 8.7 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:18,888 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.35 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.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149112.12 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 GB). Free memory was 996.5 MB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 88.21 ms. Allocated memory is still 8.7 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 213 ProgramPointsBefore, 116 ProgramPointsAfterwards, 256 TransitionsBefore, 136 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 11555 VarBasedMoverChecksPositive, 393 VarBasedMoverChecksNegative, 130 SemBasedMoverChecksPositive, 392 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 131755 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L858] FCALL, FORK 0 pthread_create(&t117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] FCALL, FORK 0 pthread_create(&t120, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = z$w_buff0 [L804] 4 z$w_buff0 = 1 [L805] 4 z$w_buff1_used = z$w_buff0_used [L806] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$flush_delayed ? z$mem_tmp : z [L829] 4 z$flush_delayed = (_Bool)0 [L832] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 __unbuffered_p2_EAX = y [L778] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 3 z$flush_delayed = weak$$choice2 [L781] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 201 locations, 2 error locations. Result: UNSAFE, OverallTime: 148.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5881 SDtfs, 8648 SDslu, 13826 SDs, 0 SdLazy, 6554 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266551occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 94.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 659590 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 165594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...