./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7daf64d82ddacd7bc1ccf73527b07db58b3fb4c0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:12:19,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:19,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:19,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:19,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:19,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:19,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:19,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:19,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:19,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:19,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:19,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:19,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:19,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:19,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:19,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:19,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:19,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:19,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:19,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:19,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:19,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:19,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:19,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:19,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:19,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:19,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:19,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:19,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:19,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:19,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:19,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:19,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:19,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:19,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:19,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:19,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:19,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:19,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:19,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:19,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:19,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:12:19,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:19,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:19,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:19,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:19,969 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:19,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:19,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:19,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:19,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:19,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:19,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:19,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:19,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:19,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:19,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:19,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:19,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:19,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:19,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:19,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:19,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:19,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:19,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:19,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:19,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:19,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:19,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:19,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:19,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:19,978 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7daf64d82ddacd7bc1ccf73527b07db58b3fb4c0 [2019-11-28 18:12:20,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:20,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:20,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:20,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:20,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:20,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2019-11-28 18:12:20,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6467fb60a/ba600197c67e4eb29ff8c6bdc3c9d555/FLAG37918bd84 [2019-11-28 18:12:21,000 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:21,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2019-11-28 18:12:21,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6467fb60a/ba600197c67e4eb29ff8c6bdc3c9d555/FLAG37918bd84 [2019-11-28 18:12:21,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6467fb60a/ba600197c67e4eb29ff8c6bdc3c9d555 [2019-11-28 18:12:21,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:21,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:21,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:21,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:21,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:21,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:21" (1/1) ... [2019-11-28 18:12:21,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be19a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:21, skipping insertion in model container [2019-11-28 18:12:21,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:21" (1/1) ... [2019-11-28 18:12:21,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:21,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:21,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:21,883 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:21,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:22,019 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:22,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22 WrapperNode [2019-11-28 18:12:22,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:22,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:22,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:22,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:22,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:22,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:22,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:22,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:22,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... [2019-11-28 18:12:22,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:22,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:22,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:22,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:22,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:12:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:22,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:22,242 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:12:22,932 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:22,932 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:22,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:22 BoogieIcfgContainer [2019-11-28 18:12:22,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:22,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:22,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:22,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:22,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:21" (1/3) ... [2019-11-28 18:12:22,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c563fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:22, skipping insertion in model container [2019-11-28 18:12:22,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:22" (2/3) ... [2019-11-28 18:12:22,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c563fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:22, skipping insertion in model container [2019-11-28 18:12:22,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:22" (3/3) ... [2019-11-28 18:12:22,944 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-11-28 18:12:22,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:22,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:22,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:22,965 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:23,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:23,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:23,093 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:23,094 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:23,094 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:23,094 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:23,094 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:23,095 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:23,095 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:23,095 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:23,113 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-11-28 18:12:23,116 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:23,203 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:23,203 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:23,222 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:23,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:23,301 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:23,302 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:23,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:23,332 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:12:23,333 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:28,423 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:28,559 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:28,821 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-11-28 18:12:28,822 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-11-28 18:12:28,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-11-28 18:12:29,390 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-11-28 18:12:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-11-28 18:12:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:12:29,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:29,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:12:29,401 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-11-28 18:12:29,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:29,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811550833] [2019-11-28 18:12:29,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:29,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811550833] [2019-11-28 18:12:29,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:29,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:29,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721487316] [2019-11-28 18:12:29,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:29,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:29,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:29,673 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-11-28 18:12:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:29,970 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-11-28 18:12:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:29,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:12:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:30,054 INFO L225 Difference]: With dead ends: 8598 [2019-11-28 18:12:30,055 INFO L226 Difference]: Without dead ends: 7662 [2019-11-28 18:12:30,056 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-11-28 18:12:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-28 18:12:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-11-28 18:12:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-11-28 18:12:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-11-28 18:12:30,455 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-11-28 18:12:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:30,456 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-11-28 18:12:30,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-11-28 18:12:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:30,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:30,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:30,461 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-11-28 18:12:30,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:30,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582361233] [2019-11-28 18:12:30,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:30,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582361233] [2019-11-28 18:12:30,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:30,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:30,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747996425] [2019-11-28 18:12:30,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:30,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:30,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:30,563 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 4 states. [2019-11-28 18:12:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:30,975 INFO L93 Difference]: Finished difference Result 11648 states and 36322 transitions. [2019-11-28 18:12:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:30,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:12:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:31,051 INFO L225 Difference]: With dead ends: 11648 [2019-11-28 18:12:31,052 INFO L226 Difference]: Without dead ends: 11634 [2019-11-28 18:12:31,053 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-11-28 18:12:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-11-28 18:12:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 10434. [2019-11-28 18:12:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-11-28 18:12:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 33156 transitions. [2019-11-28 18:12:31,611 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 33156 transitions. Word has length 11 [2019-11-28 18:12:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:31,611 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 33156 transitions. [2019-11-28 18:12:31,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 33156 transitions. [2019-11-28 18:12:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:31,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:31,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:31,623 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-11-28 18:12:31,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:31,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563743607] [2019-11-28 18:12:31,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:31,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563743607] [2019-11-28 18:12:31,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:31,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:31,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074617772] [2019-11-28 18:12:31,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:31,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:31,728 INFO L87 Difference]: Start difference. First operand 10434 states and 33156 transitions. Second operand 3 states. [2019-11-28 18:12:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:31,909 INFO L93 Difference]: Finished difference Result 15676 states and 49653 transitions. [2019-11-28 18:12:31,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:31,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:31,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:31,969 INFO L225 Difference]: With dead ends: 15676 [2019-11-28 18:12:31,970 INFO L226 Difference]: Without dead ends: 15676 [2019-11-28 18:12:31,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2019-11-28 18:12:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 11940. [2019-11-28 18:12:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-11-28 18:12:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 38316 transitions. [2019-11-28 18:12:32,409 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 38316 transitions. Word has length 14 [2019-11-28 18:12:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:32,410 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 38316 transitions. [2019-11-28 18:12:32,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 38316 transitions. [2019-11-28 18:12:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:32,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:32,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:32,416 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-11-28 18:12:32,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:32,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084607389] [2019-11-28 18:12:32,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:32,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084607389] [2019-11-28 18:12:32,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:32,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:32,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696916124] [2019-11-28 18:12:32,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:32,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:32,504 INFO L87 Difference]: Start difference. First operand 11940 states and 38316 transitions. Second operand 4 states. [2019-11-28 18:12:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:32,735 INFO L93 Difference]: Finished difference Result 14601 states and 46104 transitions. [2019-11-28 18:12:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:32,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:32,792 INFO L225 Difference]: With dead ends: 14601 [2019-11-28 18:12:32,792 INFO L226 Difference]: Without dead ends: 14601 [2019-11-28 18:12:32,793 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-11-28 18:12:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2019-11-28 18:12:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 13192. [2019-11-28 18:12:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-11-28 18:12:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 42090 transitions. [2019-11-28 18:12:33,419 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 42090 transitions. Word has length 14 [2019-11-28 18:12:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:33,420 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 42090 transitions. [2019-11-28 18:12:33,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 42090 transitions. [2019-11-28 18:12:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:33,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:33,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:33,424 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-11-28 18:12:33,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:33,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078946044] [2019-11-28 18:12:33,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:33,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078946044] [2019-11-28 18:12:33,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:33,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285169135] [2019-11-28 18:12:33,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:33,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:33,480 INFO L87 Difference]: Start difference. First operand 13192 states and 42090 transitions. Second operand 4 states. [2019-11-28 18:12:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:33,730 INFO L93 Difference]: Finished difference Result 15525 states and 49066 transitions. [2019-11-28 18:12:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:33,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:33,769 INFO L225 Difference]: With dead ends: 15525 [2019-11-28 18:12:33,769 INFO L226 Difference]: Without dead ends: 15525 [2019-11-28 18:12:33,770 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-11-28 18:12:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-11-28 18:12:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13326. [2019-11-28 18:12:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13326 states. [2019-11-28 18:12:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13326 states to 13326 states and 42542 transitions. [2019-11-28 18:12:34,176 INFO L78 Accepts]: Start accepts. Automaton has 13326 states and 42542 transitions. Word has length 14 [2019-11-28 18:12:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,176 INFO L462 AbstractCegarLoop]: Abstraction has 13326 states and 42542 transitions. [2019-11-28 18:12:34,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13326 states and 42542 transitions. [2019-11-28 18:12:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:34,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1158249311, now seen corresponding path program 1 times [2019-11-28 18:12:34,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006365049] [2019-11-28 18:12:34,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:34,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006365049] [2019-11-28 18:12:34,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:34,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748869116] [2019-11-28 18:12:34,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:34,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,257 INFO L87 Difference]: Start difference. First operand 13326 states and 42542 transitions. Second operand 3 states. [2019-11-28 18:12:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,325 INFO L93 Difference]: Finished difference Result 13463 states and 42825 transitions. [2019-11-28 18:12:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,362 INFO L225 Difference]: With dead ends: 13463 [2019-11-28 18:12:34,362 INFO L226 Difference]: Without dead ends: 13463 [2019-11-28 18:12:34,362 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-11-28 18:12:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13463 states. [2019-11-28 18:12:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13463 to 13323. [2019-11-28 18:12:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13323 states. [2019-11-28 18:12:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13323 states to 13323 states and 42533 transitions. [2019-11-28 18:12:34,768 INFO L78 Accepts]: Start accepts. Automaton has 13323 states and 42533 transitions. Word has length 16 [2019-11-28 18:12:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,769 INFO L462 AbstractCegarLoop]: Abstraction has 13323 states and 42533 transitions. [2019-11-28 18:12:34,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 13323 states and 42533 transitions. [2019-11-28 18:12:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:12:34,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1958502356, now seen corresponding path program 1 times [2019-11-28 18:12:34,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509672843] [2019-11-28 18:12:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:34,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509672843] [2019-11-28 18:12:34,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:34,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463451895] [2019-11-28 18:12:34,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:34,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:34,883 INFO L87 Difference]: Start difference. First operand 13323 states and 42533 transitions. Second operand 4 states. [2019-11-28 18:12:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,964 INFO L93 Difference]: Finished difference Result 13441 states and 42760 transitions. [2019-11-28 18:12:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:34,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:12:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,989 INFO L225 Difference]: With dead ends: 13441 [2019-11-28 18:12:34,989 INFO L226 Difference]: Without dead ends: 13441 [2019-11-28 18:12:34,990 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-11-28 18:12:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13441 states. [2019-11-28 18:12:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13441 to 13301. [2019-11-28 18:12:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13301 states. [2019-11-28 18:12:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13301 states to 13301 states and 42468 transitions. [2019-11-28 18:12:35,682 INFO L78 Accepts]: Start accepts. Automaton has 13301 states and 42468 transitions. Word has length 17 [2019-11-28 18:12:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:35,682 INFO L462 AbstractCegarLoop]: Abstraction has 13301 states and 42468 transitions. [2019-11-28 18:12:35,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13301 states and 42468 transitions. [2019-11-28 18:12:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:12:35,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:35,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:35,692 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1545984591, now seen corresponding path program 1 times [2019-11-28 18:12:35,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:35,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912087467] [2019-11-28 18:12:35,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:35,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912087467] [2019-11-28 18:12:35,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:35,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:35,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260356791] [2019-11-28 18:12:35,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:35,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:35,745 INFO L87 Difference]: Start difference. First operand 13301 states and 42468 transitions. Second operand 3 states. [2019-11-28 18:12:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:35,812 INFO L93 Difference]: Finished difference Result 12583 states and 39558 transitions. [2019-11-28 18:12:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:35,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:12:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:35,833 INFO L225 Difference]: With dead ends: 12583 [2019-11-28 18:12:35,834 INFO L226 Difference]: Without dead ends: 12583 [2019-11-28 18:12:35,834 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-11-28 18:12:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12583 states. [2019-11-28 18:12:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12583 to 12503. [2019-11-28 18:12:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2019-11-28 18:12:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 39326 transitions. [2019-11-28 18:12:36,109 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 39326 transitions. Word has length 17 [2019-11-28 18:12:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,110 INFO L462 AbstractCegarLoop]: Abstraction has 12503 states and 39326 transitions. [2019-11-28 18:12:36,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 39326 transitions. [2019-11-28 18:12:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:12:36,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:36,116 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash 819852344, now seen corresponding path program 1 times [2019-11-28 18:12:36,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428567750] [2019-11-28 18:12:36,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428567750] [2019-11-28 18:12:36,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:36,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651616143] [2019-11-28 18:12:36,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:36,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:36,161 INFO L87 Difference]: Start difference. First operand 12503 states and 39326 transitions. Second operand 3 states. [2019-11-28 18:12:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,173 INFO L93 Difference]: Finished difference Result 1631 states and 3669 transitions. [2019-11-28 18:12:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:36,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:12:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,177 INFO L225 Difference]: With dead ends: 1631 [2019-11-28 18:12:36,177 INFO L226 Difference]: Without dead ends: 1631 [2019-11-28 18:12:36,178 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-11-28 18:12:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-28 18:12:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2019-11-28 18:12:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2019-11-28 18:12:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3669 transitions. [2019-11-28 18:12:36,204 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3669 transitions. Word has length 17 [2019-11-28 18:12:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,205 INFO L462 AbstractCegarLoop]: Abstraction has 1631 states and 3669 transitions. [2019-11-28 18:12:36,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3669 transitions. [2019-11-28 18:12:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:12:36,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:36,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-11-28 18:12:36,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222044683] [2019-11-28 18:12:36,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222044683] [2019-11-28 18:12:36,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:36,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615196143] [2019-11-28 18:12:36,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:36,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,279 INFO L87 Difference]: Start difference. First operand 1631 states and 3669 transitions. Second operand 5 states. [2019-11-28 18:12:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,527 INFO L93 Difference]: Finished difference Result 2140 states and 4682 transitions. [2019-11-28 18:12:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:36,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 18:12:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,531 INFO L225 Difference]: With dead ends: 2140 [2019-11-28 18:12:36,531 INFO L226 Difference]: Without dead ends: 2140 [2019-11-28 18:12:36,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-28 18:12:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1699. [2019-11-28 18:12:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-28 18:12:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3809 transitions. [2019-11-28 18:12:36,555 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3809 transitions. Word has length 24 [2019-11-28 18:12:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,555 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 3809 transitions. [2019-11-28 18:12:36,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3809 transitions. [2019-11-28 18:12:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:36,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:36,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-11-28 18:12:36,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511189511] [2019-11-28 18:12:36,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511189511] [2019-11-28 18:12:36,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:36,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518732710] [2019-11-28 18:12:36,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:36,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,648 INFO L87 Difference]: Start difference. First operand 1699 states and 3809 transitions. Second operand 5 states. [2019-11-28 18:12:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,867 INFO L93 Difference]: Finished difference Result 2154 states and 4711 transitions. [2019-11-28 18:12:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:36,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,871 INFO L225 Difference]: With dead ends: 2154 [2019-11-28 18:12:36,872 INFO L226 Difference]: Without dead ends: 2154 [2019-11-28 18:12:36,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-11-28 18:12:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1645. [2019-11-28 18:12:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-11-28 18:12:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3698 transitions. [2019-11-28 18:12:36,897 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3698 transitions. Word has length 26 [2019-11-28 18:12:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,898 INFO L462 AbstractCegarLoop]: Abstraction has 1645 states and 3698 transitions. [2019-11-28 18:12:36,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3698 transitions. [2019-11-28 18:12:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:12:36,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:36,900 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-11-28 18:12:36,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471031036] [2019-11-28 18:12:36,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471031036] [2019-11-28 18:12:36,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183034881] [2019-11-28 18:12:36,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:36,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:36,956 INFO L87 Difference]: Start difference. First operand 1645 states and 3698 transitions. Second operand 4 states. [2019-11-28 18:12:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,971 INFO L93 Difference]: Finished difference Result 797 states and 1775 transitions. [2019-11-28 18:12:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:36,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:12:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,973 INFO L225 Difference]: With dead ends: 797 [2019-11-28 18:12:36,973 INFO L226 Difference]: Without dead ends: 797 [2019-11-28 18:12:36,973 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-11-28 18:12:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-28 18:12:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-11-28 18:12:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-28 18:12:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1775 transitions. [2019-11-28 18:12:36,985 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1775 transitions. Word has length 28 [2019-11-28 18:12:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,986 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1775 transitions. [2019-11-28 18:12:36,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1775 transitions. [2019-11-28 18:12:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:36,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,989 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] [2019-11-28 18:12:36,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-11-28 18:12:36,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113441633] [2019-11-28 18:12:36,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:37,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113441633] [2019-11-28 18:12:37,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:37,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422524730] [2019-11-28 18:12:37,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:37,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:37,098 INFO L87 Difference]: Start difference. First operand 797 states and 1775 transitions. Second operand 3 states. [2019-11-28 18:12:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:37,157 INFO L93 Difference]: Finished difference Result 1019 states and 2241 transitions. [2019-11-28 18:12:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:37,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:12:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:37,160 INFO L225 Difference]: With dead ends: 1019 [2019-11-28 18:12:37,161 INFO L226 Difference]: Without dead ends: 1019 [2019-11-28 18:12:37,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-28 18:12:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 833. [2019-11-28 18:12:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-11-28 18:12:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1860 transitions. [2019-11-28 18:12:37,181 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1860 transitions. Word has length 51 [2019-11-28 18:12:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,182 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1860 transitions. [2019-11-28 18:12:37,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1860 transitions. [2019-11-28 18:12:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:37,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,185 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] [2019-11-28 18:12:37,186 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-11-28 18:12:37,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517824234] [2019-11-28 18:12:37,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:37,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517824234] [2019-11-28 18:12:37,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:37,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651002885] [2019-11-28 18:12:37,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:37,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:37,409 INFO L87 Difference]: Start difference. First operand 833 states and 1860 transitions. Second operand 7 states. [2019-11-28 18:12:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:37,707 INFO L93 Difference]: Finished difference Result 2530 states and 5545 transitions. [2019-11-28 18:12:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:37,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:12:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:37,712 INFO L225 Difference]: With dead ends: 2530 [2019-11-28 18:12:37,712 INFO L226 Difference]: Without dead ends: 1756 [2019-11-28 18:12:37,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-11-28 18:12:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 953. [2019-11-28 18:12:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-28 18:12:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2118 transitions. [2019-11-28 18:12:37,736 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2118 transitions. Word has length 52 [2019-11-28 18:12:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,736 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2118 transitions. [2019-11-28 18:12:37,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2118 transitions. [2019-11-28 18:12:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:37,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,740 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] [2019-11-28 18:12:37,740 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-11-28 18:12:37,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761986876] [2019-11-28 18:12:37,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:37,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:37,942 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:37,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_35| 4) |v_#length_15|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35|) |v_ULTIMATE.start_main_~#t899~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_24| 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35|) 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_35|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_17|, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_24|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:37,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:37,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In70578782 ~z$w_buff1~0_Out70578782) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782)) (= ~z$w_buff0_used~0_In70578782 ~z$w_buff1_used~0_Out70578782) (= |P0Thread1of1ForFork0_#in~arg.base_In70578782| P0Thread1of1ForFork0_~arg.base_Out70578782) (= 1 ~z$w_buff0_used~0_Out70578782) (= P0Thread1of1ForFork0_~arg.offset_Out70578782 |P0Thread1of1ForFork0_#in~arg.offset_In70578782|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out70578782 256))) (not (= (mod ~z$w_buff1_used~0_Out70578782 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782|) (= ~z$w_buff0~0_Out70578782 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In70578782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70578782, ~z$w_buff0~0=~z$w_buff0~0_In70578782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In70578782|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In70578782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out70578782, ~z$w_buff0~0=~z$w_buff0~0_Out70578782, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out70578782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In70578782|, ~z$w_buff1~0=~z$w_buff1~0_Out70578782, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out70578782, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out70578782} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:37,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-890966262 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-890966262| |P1Thread1of1ForFork1_#t~ite23_Out-890966262|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-890966262| ~z$w_buff1_used~0_In-890966262)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-890966262 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-890966262 256) 0) (and (= (mod ~z$w_buff1_used~0_In-890966262 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd2~0_In-890966262 256) 0) .cse1))) (= ~z$w_buff1_used~0_In-890966262 |P1Thread1of1ForFork1_#t~ite23_Out-890966262|) .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-890966262| |P1Thread1of1ForFork1_#t~ite23_Out-890966262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-890966262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-890966262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890966262, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-890966262|, ~weak$$choice2~0=~weak$$choice2~0_In-890966262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-890966262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-890966262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-890966262, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-890966262|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890966262, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-890966262|, ~weak$$choice2~0=~weak$$choice2~0_In-890966262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-890966262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:37,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:37,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:37,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1517616419 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1517616419 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1517616419| ~z$w_buff0_used~0_In1517616419) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1517616419| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1517616419} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1517616419} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:37,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1956347873 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1956347873 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1956347873 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1956347873 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1956347873|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1956347873| ~z$w_buff1_used~0_In-1956347873) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956347873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956347873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956347873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956347873} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1956347873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956347873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956347873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956347873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956347873} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:37,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1434102692 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1434102692 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_Out1434102692 ~z$r_buff0_thd1~0_In1434102692))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out1434102692 0) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1434102692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1434102692} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1434102692, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1434102692|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1434102692} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:37,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-411321487 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-411321487 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-411321487 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-411321487 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-411321487|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In-411321487 |P0Thread1of1ForFork0_#t~ite8_Out-411321487|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-411321487, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-411321487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411321487, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-411321487} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-411321487, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-411321487|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-411321487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411321487, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-411321487} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:37,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In2096071276 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2096071276 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out2096071276| |P1Thread1of1ForFork1_#t~ite33_Out2096071276|))) (or (and (or .cse0 .cse1) (= ~z~0_In2096071276 |P1Thread1of1ForFork1_#t~ite32_Out2096071276|) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out2096071276| ~z$w_buff1~0_In2096071276) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2096071276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096071276, ~z$w_buff1~0=~z$w_buff1~0_In2096071276, ~z~0=~z~0_In2096071276} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2096071276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096071276, ~z$w_buff1~0=~z$w_buff1~0_In2096071276, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out2096071276|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out2096071276|, ~z~0=~z~0_In2096071276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:37,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1396862542 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1396862542 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1396862542|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1396862542 |P1Thread1of1ForFork1_#t~ite34_Out-1396862542|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396862542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1396862542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396862542, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1396862542|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1396862542} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:37,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2097196739 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2097196739 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2097196739 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2097196739 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2097196739| ~z$w_buff1_used~0_In2097196739) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2097196739|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2097196739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2097196739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2097196739, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097196739} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2097196739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2097196739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2097196739, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2097196739|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097196739} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:37,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In217558017 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In217558017 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out217558017|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In217558017 |P1Thread1of1ForFork1_#t~ite36_Out217558017|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In217558017, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217558017} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In217558017, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217558017, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out217558017|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:37,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In611635474 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In611635474 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In611635474 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In611635474 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out611635474|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In611635474 |P1Thread1of1ForFork1_#t~ite37_Out611635474|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In611635474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In611635474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out611635474|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:37,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:37,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:37,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:37,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In108362744 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In108362744 256) 0))) (or (and (= ~z~0_In108362744 |ULTIMATE.start_main_#t~ite40_Out108362744|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In108362744 |ULTIMATE.start_main_#t~ite40_Out108362744|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108362744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108362744, ~z$w_buff1~0=~z$w_buff1~0_In108362744, ~z~0=~z~0_In108362744} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out108362744|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108362744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108362744, ~z$w_buff1~0=~z$w_buff1~0_In108362744, ~z~0=~z~0_In108362744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:37,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:37,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-151572089 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-151572089 256)))) (or (and (= ~z$w_buff0_used~0_In-151572089 |ULTIMATE.start_main_#t~ite42_Out-151572089|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-151572089|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-151572089|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:37,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-840584413 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-840584413 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-840584413 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-840584413 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-840584413 |ULTIMATE.start_main_#t~ite43_Out-840584413|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-840584413|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-840584413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-840584413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-840584413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840584413} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-840584413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-840584413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-840584413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840584413, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-840584413|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:37,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In798798308 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In798798308 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In798798308 |ULTIMATE.start_main_#t~ite44_Out798798308|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out798798308|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In798798308, ~z$w_buff0_used~0=~z$w_buff0_used~0_In798798308} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In798798308, ~z$w_buff0_used~0=~z$w_buff0_used~0_In798798308, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out798798308|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:37,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1333116352 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1333116352 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1333116352 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1333116352 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1333116352| ~z$r_buff1_thd0~0_In1333116352) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1333116352| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1333116352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1333116352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1333116352|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:37,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:38,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:38 BasicIcfg [2019-11-28 18:12:38,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:38,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:38,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:38,043 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:38,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:22" (3/4) ... [2019-11-28 18:12:38,053 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_35| 4) |v_#length_15|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_35|) |v_ULTIMATE.start_main_~#t899~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_24| 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_35|) 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_35|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_17|, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_24|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:38,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:38,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In70578782 ~z$w_buff1~0_Out70578782) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782)) (= ~z$w_buff0_used~0_In70578782 ~z$w_buff1_used~0_Out70578782) (= |P0Thread1of1ForFork0_#in~arg.base_In70578782| P0Thread1of1ForFork0_~arg.base_Out70578782) (= 1 ~z$w_buff0_used~0_Out70578782) (= P0Thread1of1ForFork0_~arg.offset_Out70578782 |P0Thread1of1ForFork0_#in~arg.offset_In70578782|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out70578782 256))) (not (= (mod ~z$w_buff1_used~0_Out70578782 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782|) (= ~z$w_buff0~0_Out70578782 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In70578782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70578782, ~z$w_buff0~0=~z$w_buff0~0_In70578782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In70578782|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In70578782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out70578782, ~z$w_buff0~0=~z$w_buff0~0_Out70578782, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out70578782, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out70578782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In70578782|, ~z$w_buff1~0=~z$w_buff1~0_Out70578782, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out70578782, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out70578782|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out70578782} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:38,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-890966262 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-890966262| |P1Thread1of1ForFork1_#t~ite23_Out-890966262|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-890966262| ~z$w_buff1_used~0_In-890966262)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-890966262 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-890966262 256) 0) (and (= (mod ~z$w_buff1_used~0_In-890966262 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd2~0_In-890966262 256) 0) .cse1))) (= ~z$w_buff1_used~0_In-890966262 |P1Thread1of1ForFork1_#t~ite23_Out-890966262|) .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-890966262| |P1Thread1of1ForFork1_#t~ite23_Out-890966262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-890966262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-890966262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890966262, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-890966262|, ~weak$$choice2~0=~weak$$choice2~0_In-890966262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-890966262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-890966262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-890966262, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-890966262|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890966262, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-890966262|, ~weak$$choice2~0=~weak$$choice2~0_In-890966262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-890966262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:38,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:38,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:38,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1517616419 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1517616419 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1517616419| ~z$w_buff0_used~0_In1517616419) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1517616419| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1517616419} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1517616419} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:38,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1956347873 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1956347873 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1956347873 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1956347873 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1956347873|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1956347873| ~z$w_buff1_used~0_In-1956347873) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956347873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956347873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956347873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956347873} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1956347873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956347873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1956347873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956347873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1956347873} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:38,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1434102692 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1434102692 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_Out1434102692 ~z$r_buff0_thd1~0_In1434102692))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out1434102692 0) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1434102692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1434102692} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1434102692, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1434102692|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1434102692} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:38,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-411321487 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-411321487 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-411321487 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-411321487 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-411321487|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In-411321487 |P0Thread1of1ForFork0_#t~ite8_Out-411321487|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-411321487, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-411321487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411321487, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-411321487} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-411321487, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-411321487|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-411321487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411321487, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-411321487} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:38,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In2096071276 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2096071276 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out2096071276| |P1Thread1of1ForFork1_#t~ite33_Out2096071276|))) (or (and (or .cse0 .cse1) (= ~z~0_In2096071276 |P1Thread1of1ForFork1_#t~ite32_Out2096071276|) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out2096071276| ~z$w_buff1~0_In2096071276) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2096071276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096071276, ~z$w_buff1~0=~z$w_buff1~0_In2096071276, ~z~0=~z~0_In2096071276} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2096071276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096071276, ~z$w_buff1~0=~z$w_buff1~0_In2096071276, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out2096071276|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out2096071276|, ~z~0=~z~0_In2096071276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:38,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1396862542 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1396862542 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1396862542|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1396862542 |P1Thread1of1ForFork1_#t~ite34_Out-1396862542|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396862542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1396862542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1396862542, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1396862542|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1396862542} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:38,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2097196739 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2097196739 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2097196739 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2097196739 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2097196739| ~z$w_buff1_used~0_In2097196739) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2097196739|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2097196739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2097196739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2097196739, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097196739} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2097196739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2097196739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2097196739, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2097196739|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097196739} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:38,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In217558017 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In217558017 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out217558017|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In217558017 |P1Thread1of1ForFork1_#t~ite36_Out217558017|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In217558017, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217558017} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In217558017, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217558017, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out217558017|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:38,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In611635474 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In611635474 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In611635474 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In611635474 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out611635474|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In611635474 |P1Thread1of1ForFork1_#t~ite37_Out611635474|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In611635474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In611635474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out611635474|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:38,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:38,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:38,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:38,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In108362744 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In108362744 256) 0))) (or (and (= ~z~0_In108362744 |ULTIMATE.start_main_#t~ite40_Out108362744|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In108362744 |ULTIMATE.start_main_#t~ite40_Out108362744|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108362744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108362744, ~z$w_buff1~0=~z$w_buff1~0_In108362744, ~z~0=~z~0_In108362744} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out108362744|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In108362744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108362744, ~z$w_buff1~0=~z$w_buff1~0_In108362744, ~z~0=~z~0_In108362744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:38,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:38,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-151572089 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-151572089 256)))) (or (and (= ~z$w_buff0_used~0_In-151572089 |ULTIMATE.start_main_#t~ite42_Out-151572089|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-151572089|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-151572089|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:38,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-840584413 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-840584413 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-840584413 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-840584413 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-840584413 |ULTIMATE.start_main_#t~ite43_Out-840584413|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-840584413|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-840584413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-840584413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-840584413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840584413} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-840584413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-840584413, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-840584413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840584413, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-840584413|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:38,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In798798308 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In798798308 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In798798308 |ULTIMATE.start_main_#t~ite44_Out798798308|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out798798308|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In798798308, ~z$w_buff0_used~0=~z$w_buff0_used~0_In798798308} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In798798308, ~z$w_buff0_used~0=~z$w_buff0_used~0_In798798308, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out798798308|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:38,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1333116352 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1333116352 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1333116352 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1333116352 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1333116352| ~z$r_buff1_thd0~0_In1333116352) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1333116352| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1333116352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1333116352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1333116352|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:38,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:38,173 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:38,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:38,175 INFO L168 Benchmark]: Toolchain (without parser) took 16912.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.6 MB). Free memory was 946.9 MB in the beginning and 674.2 MB in the end (delta: 272.8 MB). Peak memory consumption was 738.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,176 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:38,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 946.9 MB in the beginning and 1.0 GB in the end (delta: -93.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:38,178 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,179 INFO L168 Benchmark]: RCFGBuilder took 803.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,179 INFO L168 Benchmark]: TraceAbstraction took 15107.00 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 391.1 MB). Free memory was 986.2 MB in the beginning and 699.9 MB in the end (delta: 286.4 MB). Peak memory consumption was 677.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,180 INFO L168 Benchmark]: Witness Printer took 131.31 ms. Allocated memory is still 1.5 GB. Free memory was 699.9 MB in the beginning and 674.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:38,183 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.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 756.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 946.9 MB in the beginning and 1.0 GB in the end (delta: -93.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 803.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15107.00 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 391.1 MB). Free memory was 986.2 MB in the beginning and 699.9 MB in the end (delta: 286.4 MB). Peak memory consumption was 677.5 MB. Max. memory is 11.5 GB. * Witness Printer took 131.31 ms. Allocated memory is still 1.5 GB. Free memory was 699.9 MB in the beginning and 674.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L815] 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 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1731 SDtfs, 1215 SDslu, 2818 SDs, 0 SdLazy, 1079 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13326occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 10843 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 38538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...