./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix012_power.oepc.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/mix012_power.oepc.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 a62f1bf2aaf68d414a9d02811366902b8fbf118d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03:47,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:03:47,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:03:47,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:03:47,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:03:47,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:03:47,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:03:47,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:03:47,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:03:47,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:03:47,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:03:47,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:03:47,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:03:47,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:03:47,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:03:47,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:03:47,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:03:47,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:03:47,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:03:47,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:03:47,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:03:47,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:03:47,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:03:47,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:03:47,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:03:47,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:03:47,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:03:47,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:03:47,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:03:47,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:03:47,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:03:47,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:03:47,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:03:47,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:03:47,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:03:47,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:03:47,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:03:47,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:03:47,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:03:47,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:03:47,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:03:47,919 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:03:47,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:03:47,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:03:47,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:03:47,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:03:47,937 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:03:47,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:03:47,937 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:03:47,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:03:47,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:03:47,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:03:47,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:03:47,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:03:47,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:03:47,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:03:47,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:03:47,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:03:47,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:03:47,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:03:47,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:03:47,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:03:47,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:03:47,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:03:47,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:03:47,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:03:47,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:03:47,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:03:47,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:03:47,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:03:47,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:03:47,942 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 -> a62f1bf2aaf68d414a9d02811366902b8fbf118d [2019-11-28 18:03:48,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:03:48,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:03:48,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:03:48,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:03:48,329 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:03:48,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix012_power.oepc.i [2019-11-28 18:03:48,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e970c2fa/d0b6854523f043db810990dcf90a3a66/FLAG330f5317a [2019-11-28 18:03:48,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:03:48,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix012_power.oepc.i [2019-11-28 18:03:48,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e970c2fa/d0b6854523f043db810990dcf90a3a66/FLAG330f5317a [2019-11-28 18:03:49,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e970c2fa/d0b6854523f043db810990dcf90a3a66 [2019-11-28 18:03:49,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:03:49,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:03:49,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:49,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:03:49,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:03:49,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:49,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b13bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49, skipping insertion in model container [2019-11-28 18:03:49,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:49,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:03:49,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:03:49,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:03:49,826 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:03:49,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:03:49,999 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:03:50,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49 WrapperNode [2019-11-28 18:03:50,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:50,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:03:50,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:03:50,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:03:50,011 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:03:49" (1/1) ... [2019-11-28 18:03:50,035 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:03:49" (1/1) ... [2019-11-28 18:03:50,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:03:50,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:03:50,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:03:50,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:03:50,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (1/1) ... [2019-11-28 18:03:50,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:03:50,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:03:50,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:03:50,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:03:50,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (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:03:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:03:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:03:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:03:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:03:50,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:03:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:03:50,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:03:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:03:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:03:50,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:03:50,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:03:50,207 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:03:50,936 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:03:50,936 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:03:50,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:50 BoogieIcfgContainer [2019-11-28 18:03:50,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:03:50,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:03:50,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:03:50,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:03:50,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:03:49" (1/3) ... [2019-11-28 18:03:50,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aebf59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:03:50, skipping insertion in model container [2019-11-28 18:03:50,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:49" (2/3) ... [2019-11-28 18:03:50,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aebf59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:03:50, skipping insertion in model container [2019-11-28 18:03:50,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:50" (3/3) ... [2019-11-28 18:03:50,953 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-11-28 18:03:50,964 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:03:50,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:03:50,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:03:50,980 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:03:51,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,041 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,041 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,042 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,042 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,059 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:03:51,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:03:51,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:03:51,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:03:51,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:03:51,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:03:51,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:03:51,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:03:51,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:03:51,150 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:03:51,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:03:51,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:03:51,279 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:03:51,280 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:03:51,303 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:03:51,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:03:51,382 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:03:51,383 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:03:51,390 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:03:51,408 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:03:51,410 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:03:56,363 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:03:56,487 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:03:56,751 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-11-28 18:03:56,751 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:03:56,755 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:03:57,470 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-11-28 18:03:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-11-28 18:03:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:03:57,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:57,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:03:57,483 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:03:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:57,492 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-11-28 18:03:57,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:57,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882060030] [2019-11-28 18:03:57,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:57,836 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:03:57,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882060030] [2019-11-28 18:03:57,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:57,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:03:57,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336137253] [2019-11-28 18:03:57,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:57,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:57,876 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-11-28 18:03:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:58,181 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-11-28 18:03:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:58,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:03:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:58,270 INFO L225 Difference]: With dead ends: 8760 [2019-11-28 18:03:58,271 INFO L226 Difference]: Without dead ends: 7798 [2019-11-28 18:03:58,272 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:03:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-11-28 18:03:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-11-28 18:03:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-11-28 18:03:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-11-28 18:03:58,729 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-11-28 18:03:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:58,730 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-11-28 18:03:58,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-11-28 18:03:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:03:58,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:58,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:58,738 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:03:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-11-28 18:03:58,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:58,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085672172] [2019-11-28 18:03:58,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:58,906 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:03:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085672172] [2019-11-28 18:03:58,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:58,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:58,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002718833] [2019-11-28 18:03:58,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:58,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:58,910 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 4 states. [2019-11-28 18:03:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:59,421 INFO L93 Difference]: Finished difference Result 11906 states and 36801 transitions. [2019-11-28 18:03:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:59,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:03:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:59,511 INFO L225 Difference]: With dead ends: 11906 [2019-11-28 18:03:59,511 INFO L226 Difference]: Without dead ends: 11892 [2019-11-28 18:03:59,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:03:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2019-11-28 18:03:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 10583. [2019-11-28 18:03:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2019-11-28 18:03:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 33330 transitions. [2019-11-28 18:03:59,931 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 33330 transitions. Word has length 11 [2019-11-28 18:03:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:59,931 INFO L462 AbstractCegarLoop]: Abstraction has 10583 states and 33330 transitions. [2019-11-28 18:03:59,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 33330 transitions. [2019-11-28 18:03:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:03:59,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:59,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:59,937 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:03:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-11-28 18:03:59,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:59,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808138753] [2019-11-28 18:03:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:00,049 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:04:00,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808138753] [2019-11-28 18:04:00,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:00,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:00,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025024517] [2019-11-28 18:04:00,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:00,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:00,052 INFO L87 Difference]: Start difference. First operand 10583 states and 33330 transitions. Second operand 5 states. [2019-11-28 18:04:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:00,492 INFO L93 Difference]: Finished difference Result 15056 states and 46886 transitions. [2019-11-28 18:04:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:04:00,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:04:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:00,549 INFO L225 Difference]: With dead ends: 15056 [2019-11-28 18:04:00,549 INFO L226 Difference]: Without dead ends: 15056 [2019-11-28 18:04:00,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2019-11-28 18:04:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 12203. [2019-11-28 18:04:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12203 states. [2019-11-28 18:04:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 38425 transitions. [2019-11-28 18:04:00,999 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 38425 transitions. Word has length 14 [2019-11-28 18:04:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:01,001 INFO L462 AbstractCegarLoop]: Abstraction has 12203 states and 38425 transitions. [2019-11-28 18:04:01,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 38425 transitions. [2019-11-28 18:04:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:04:01,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:01,005 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:04:01,006 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:04:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -191481557, now seen corresponding path program 1 times [2019-11-28 18:04:01,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:01,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522015138] [2019-11-28 18:04:01,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:01,076 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:04:01,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522015138] [2019-11-28 18:04:01,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:01,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:01,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740335467] [2019-11-28 18:04:01,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:01,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:01,082 INFO L87 Difference]: Start difference. First operand 12203 states and 38425 transitions. Second operand 3 states. [2019-11-28 18:04:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:01,099 INFO L93 Difference]: Finished difference Result 1592 states and 3548 transitions. [2019-11-28 18:04:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:04:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:01,105 INFO L225 Difference]: With dead ends: 1592 [2019-11-28 18:04:01,105 INFO L226 Difference]: Without dead ends: 1592 [2019-11-28 18:04:01,105 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:04:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-11-28 18:04:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1572. [2019-11-28 18:04:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-28 18:04:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-11-28 18:04:01,140 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 16 [2019-11-28 18:04:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:01,141 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-11-28 18:04:01,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-11-28 18:04:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:04:01,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:01,143 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:04:01,143 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:04:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-11-28 18:04:01,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:01,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359653281] [2019-11-28 18:04:01,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:01,280 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:04:01,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359653281] [2019-11-28 18:04:01,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:01,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:04:01,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342843685] [2019-11-28 18:04:01,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:04:01,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:01,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:04:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:01,282 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-11-28 18:04:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:01,782 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-11-28 18:04:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:04:01,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:04:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:01,788 INFO L225 Difference]: With dead ends: 2337 [2019-11-28 18:04:01,788 INFO L226 Difference]: Without dead ends: 2337 [2019-11-28 18:04:01,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:04:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-11-28 18:04:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-11-28 18:04:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-11-28 18:04:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-11-28 18:04:01,824 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-11-28 18:04:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:01,824 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-11-28 18:04:01,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:04:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-11-28 18:04:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:04:01,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:01,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:01,827 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:04:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-11-28 18:04:01,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:01,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343751919] [2019-11-28 18:04:01,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:01,917 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:04:01,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343751919] [2019-11-28 18:04:01,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:01,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:04:01,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796418266] [2019-11-28 18:04:01,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:01,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:01,920 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-11-28 18:04:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:02,388 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-11-28 18:04:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:04:02,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:04:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:02,396 INFO L225 Difference]: With dead ends: 2417 [2019-11-28 18:04:02,396 INFO L226 Difference]: Without dead ends: 2417 [2019-11-28 18:04:02,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-11-28 18:04:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-11-28 18:04:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-11-28 18:04:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-11-28 18:04:02,440 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-11-28 18:04:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:02,441 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-11-28 18:04:02,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-11-28 18:04:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:04:02,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:02,444 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] [2019-11-28 18:04:02,444 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:04:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-11-28 18:04:02,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:02,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707942394] [2019-11-28 18:04:02,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:02,500 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:04:02,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707942394] [2019-11-28 18:04:02,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:02,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:02,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532538135] [2019-11-28 18:04:02,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:04:02,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:04:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:02,502 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-11-28 18:04:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:02,521 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-11-28 18:04:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:04:02,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:04:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:02,524 INFO L225 Difference]: With dead ends: 1195 [2019-11-28 18:04:02,524 INFO L226 Difference]: Without dead ends: 1195 [2019-11-28 18:04:02,525 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:04:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-11-28 18:04:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-11-28 18:04:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-11-28 18:04:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-11-28 18:04:02,546 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-11-28 18:04:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:02,546 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-11-28 18:04:02,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:04:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-11-28 18:04:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:02,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:02,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:02,550 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:04:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-11-28 18:04:02,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:02,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062179540] [2019-11-28 18:04:02,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:02,692 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:04:02,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062179540] [2019-11-28 18:04:02,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:02,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:04:02,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646728602] [2019-11-28 18:04:02,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:02,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:02,695 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-11-28 18:04:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:03,538 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-11-28 18:04:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:04:03,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 18:04:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:03,543 INFO L225 Difference]: With dead ends: 1596 [2019-11-28 18:04:03,543 INFO L226 Difference]: Without dead ends: 1590 [2019-11-28 18:04:03,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:04:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-11-28 18:04:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-11-28 18:04:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-11-28 18:04:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-11-28 18:04:03,567 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-11-28 18:04:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:03,567 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-11-28 18:04:03,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-11-28 18:04:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:03,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:03,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:03,571 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:04:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-11-28 18:04:03,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:03,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408160132] [2019-11-28 18:04:03,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:03,661 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:04:03,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408160132] [2019-11-28 18:04:03,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:03,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:03,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285117821] [2019-11-28 18:04:03,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:03,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:03,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:03,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:03,664 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-11-28 18:04:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:03,721 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-11-28 18:04:03,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:03,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:04:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:03,725 INFO L225 Difference]: With dead ends: 1575 [2019-11-28 18:04:03,725 INFO L226 Difference]: Without dead ends: 1575 [2019-11-28 18:04:03,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:04:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-11-28 18:04:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-11-28 18:04:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-28 18:04:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-11-28 18:04:03,749 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-11-28 18:04:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:03,749 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-11-28 18:04:03,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-11-28 18:04:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:03,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:03,754 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:04:03,754 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:04:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-11-28 18:04:03,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:03,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265307050] [2019-11-28 18:04:03,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:03,915 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:04:03,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265307050] [2019-11-28 18:04:03,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:04:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763134343] [2019-11-28 18:04:03,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:04:03,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:04:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:04:03,919 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 8 states. [2019-11-28 18:04:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:04,946 INFO L93 Difference]: Finished difference Result 1759 states and 3621 transitions. [2019-11-28 18:04:04,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 18:04:04,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-28 18:04:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:04,951 INFO L225 Difference]: With dead ends: 1759 [2019-11-28 18:04:04,952 INFO L226 Difference]: Without dead ends: 1759 [2019-11-28 18:04:04,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-11-28 18:04:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-11-28 18:04:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1200. [2019-11-28 18:04:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2019-11-28 18:04:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2557 transitions. [2019-11-28 18:04:04,975 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2557 transitions. Word has length 51 [2019-11-28 18:04:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:04,975 INFO L462 AbstractCegarLoop]: Abstraction has 1200 states and 2557 transitions. [2019-11-28 18:04:04,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:04:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2557 transitions. [2019-11-28 18:04:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:04,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:04,979 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:04:04,979 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:04:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-11-28 18:04:04,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:04,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530714917] [2019-11-28 18:04:04,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:05,062 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:04:05,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530714917] [2019-11-28 18:04:05,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:05,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:05,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615250299] [2019-11-28 18:04:05,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:05,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:05,064 INFO L87 Difference]: Start difference. First operand 1200 states and 2557 transitions. Second operand 3 states. [2019-11-28 18:04:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:05,082 INFO L93 Difference]: Finished difference Result 1199 states and 2555 transitions. [2019-11-28 18:04:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:05,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:04:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:05,086 INFO L225 Difference]: With dead ends: 1199 [2019-11-28 18:04:05,086 INFO L226 Difference]: Without dead ends: 1199 [2019-11-28 18:04:05,087 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:04:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-28 18:04:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 970. [2019-11-28 18:04:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-11-28 18:04:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2096 transitions. [2019-11-28 18:04:05,106 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2096 transitions. Word has length 51 [2019-11-28 18:04:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:05,107 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 2096 transitions. [2019-11-28 18:04:05,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2096 transitions. [2019-11-28 18:04:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:05,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:05,110 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:04:05,110 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:04:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1353726900, now seen corresponding path program 1 times [2019-11-28 18:04:05,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:05,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776890108] [2019-11-28 18:04:05,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:05,367 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:04:05,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776890108] [2019-11-28 18:04:05,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:05,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:04:05,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25629717] [2019-11-28 18:04:05,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:04:05,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:04:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:04:05,371 INFO L87 Difference]: Start difference. First operand 970 states and 2096 transitions. Second operand 10 states. [2019-11-28 18:04:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:06,004 INFO L93 Difference]: Finished difference Result 2449 states and 5226 transitions. [2019-11-28 18:04:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:04:06,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-28 18:04:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:06,006 INFO L225 Difference]: With dead ends: 2449 [2019-11-28 18:04:06,008 INFO L226 Difference]: Without dead ends: 795 [2019-11-28 18:04:06,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:04:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-11-28 18:04:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2019-11-28 18:04:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-28 18:04:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-11-28 18:04:06,085 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 52 [2019-11-28 18:04:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:06,085 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-11-28 18:04:06,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:04:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-11-28 18:04:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:06,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:06,088 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:04:06,089 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:04:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 2 times [2019-11-28 18:04:06,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:06,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393906805] [2019-11-28 18:04:06,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:06,197 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:04:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393906805] [2019-11-28 18:04:06,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:06,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:04:06,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257449137] [2019-11-28 18:04:06,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:06,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:06,201 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 7 states. [2019-11-28 18:04:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:06,368 INFO L93 Difference]: Finished difference Result 1395 states and 2928 transitions. [2019-11-28 18:04:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:04:06,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:04:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:06,372 INFO L225 Difference]: With dead ends: 1395 [2019-11-28 18:04:06,372 INFO L226 Difference]: Without dead ends: 945 [2019-11-28 18:04:06,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:04:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-28 18:04:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-11-28 18:04:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-28 18:04:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-11-28 18:04:06,388 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-11-28 18:04:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:06,388 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-11-28 18:04:06,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-11-28 18:04:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:06,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:06,390 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:04:06,391 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:04:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 3 times [2019-11-28 18:04:06,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:06,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261906972] [2019-11-28 18:04:06,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:06,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:04:06,573 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:04:06,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t305~0.offset_19|) (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27|) 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t305~0.base_27|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t305~0.base_27| 4)) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27| 1)) (= v_~y~0_150 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27|) |v_ULTIMATE.start_main_~#t305~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t305~0.offset=|v_ULTIMATE.start_main_~#t305~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_~#t305~0.base=|v_ULTIMATE.start_main_~#t305~0.base_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t305~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t305~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t306~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t306~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:06,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t306~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t306~0.base_10|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10| 1) |v_#valid_19|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10|) |v_ULTIMATE.start_main_~#t306~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t306~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t306~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t306~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t306~0.offset] because there is no mapped edge [2019-11-28 18:04:06,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd2~0_Out-155891255 ~y$r_buff0_thd2~0_In-155891255) (= 1 ~y$r_buff0_thd1~0_Out-155891255) (= ~x~0_In-155891255 ~__unbuffered_p0_EAX~0_Out-155891255) (= ~y$r_buff1_thd1~0_Out-155891255 ~y$r_buff0_thd1~0_In-155891255) (= ~y$r_buff1_thd0~0_Out-155891255 ~y$r_buff0_thd0~0_In-155891255) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-155891255, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-155891255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-155891255, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255, ~x~0=~x~0_In-155891255} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-155891255, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-155891255, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-155891255, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-155891255, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-155891255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-155891255, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-155891255, ~x~0=~x~0_In-155891255} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:06,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1619876709 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1619876709 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1619876709| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1619876709| ~y$w_buff0_used~0_In1619876709)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1619876709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1619876709} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1619876709|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1619876709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1619876709} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:06,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1092762614 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1092762614 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1092762614 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1092762614 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1092762614| ~y$w_buff1_used~0_In-1092762614) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1092762614| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1092762614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092762614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1092762614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092762614} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1092762614|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1092762614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092762614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1092762614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092762614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:06,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1822862604 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1822862604 ~y$r_buff0_thd1~0_In1822862604)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1822862604 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1822862604) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1822862604, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1822862604} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1822862604, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1822862604|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1822862604} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:06,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-947433757 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-947433757 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-947433757 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-947433757 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-947433757| ~y$r_buff1_thd1~0_In-947433757)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-947433757| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-947433757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-947433757, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-947433757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947433757} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-947433757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-947433757, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-947433757|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-947433757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947433757} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:06,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:06,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In151085660 256)))) (or (and .cse0 (= ~y$w_buff1~0_In151085660 |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (= |P1Thread1of1ForFork1_#t~ite18_Out151085660| |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In151085660 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In151085660 256))) (= (mod ~y$w_buff0_used~0_In151085660 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In151085660 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In151085660| |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out151085660| ~y$w_buff1~0_In151085660)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In151085660, ~y$w_buff1~0=~y$w_buff1~0_In151085660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151085660, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In151085660, ~weak$$choice2~0=~weak$$choice2~0_In151085660, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In151085660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151085660} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In151085660, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out151085660|, ~y$w_buff1~0=~y$w_buff1~0_In151085660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151085660, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In151085660, ~weak$$choice2~0=~weak$$choice2~0_In151085660, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out151085660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151085660} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:06,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In147144188 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In147144188| |P1Thread1of1ForFork1_#t~ite20_Out147144188|) (= |P1Thread1of1ForFork1_#t~ite21_Out147144188| ~y$w_buff0_used~0_In147144188) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In147144188 256)))) (or (and (= (mod ~y$w_buff1_used~0_In147144188 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In147144188 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In147144188 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out147144188| |P1Thread1of1ForFork1_#t~ite20_Out147144188|) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out147144188| ~y$w_buff0_used~0_In147144188)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147144188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147144188, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In147144188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147144188, ~weak$$choice2~0=~weak$$choice2~0_In147144188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147144188} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147144188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147144188, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out147144188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147144188, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out147144188|, ~weak$$choice2~0=~weak$$choice2~0_In147144188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147144188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:06,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse5 (= (mod ~y$w_buff1_used~0_In-572787936 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-572787936 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-572787936 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-572787936 256))) (.cse3 (= |P1Thread1of1ForFork1_#t~ite23_Out-572787936| |P1Thread1of1ForFork1_#t~ite24_Out-572787936|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-572787936 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-572787936| |P1Thread1of1ForFork1_#t~ite23_Out-572787936|) .cse3 .cse4 (or .cse1 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_Out-572787936| 0))) (and (or (and (= ~y$w_buff1_used~0_In-572787936 |P1Thread1of1ForFork1_#t~ite24_Out-572787936|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-572787936| |P1Thread1of1ForFork1_#t~ite23_In-572787936|)) (and (or (and .cse5 .cse6) (and .cse0 .cse6) .cse2) .cse3 .cse4 (= ~y$w_buff1_used~0_In-572787936 |P1Thread1of1ForFork1_#t~ite23_Out-572787936|))) (= |P1Thread1of1ForFork1_#t~ite22_In-572787936| |P1Thread1of1ForFork1_#t~ite22_Out-572787936|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-572787936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572787936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-572787936, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-572787936|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-572787936|, ~weak$$choice2~0=~weak$$choice2~0_In-572787936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572787936} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-572787936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572787936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-572787936, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-572787936|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-572787936|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-572787936|, ~weak$$choice2~0=~weak$$choice2~0_In-572787936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572787936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:06,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:06,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-126213395 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-126213395| |P1Thread1of1ForFork1_#t~ite29_Out-126213395|) (= ~y$r_buff1_thd2~0_In-126213395 |P1Thread1of1ForFork1_#t~ite30_Out-126213395|) (= |P1Thread1of1ForFork1_#t~ite28_In-126213395| |P1Thread1of1ForFork1_#t~ite28_Out-126213395|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-126213395 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-126213395| |P1Thread1of1ForFork1_#t~ite28_Out-126213395|) (or (not (= (mod ~y$w_buff1_used~0_In-126213395 256) 0)) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-126213395|) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-126213395 256))) .cse1) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-126213395| |P1Thread1of1ForFork1_#t~ite30_Out-126213395|) (not (= 0 (mod ~y$w_buff0_used~0_In-126213395 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-126213395, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-126213395|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-126213395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-126213395, ~weak$$choice2~0=~weak$$choice2~0_In-126213395, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-126213395|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126213395} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-126213395, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-126213395|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-126213395|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-126213395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-126213395, ~weak$$choice2~0=~weak$$choice2~0_In-126213395, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-126213395|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126213395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:06,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:06,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out800344053| |P1Thread1of1ForFork1_#t~ite32_Out800344053|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In800344053 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In800344053 256)))) (or (and (= ~y$w_buff1~0_In800344053 |P1Thread1of1ForFork1_#t~ite32_Out800344053|) .cse0 (not .cse1) (not .cse2)) (and (= ~y~0_In800344053 |P1Thread1of1ForFork1_#t~ite32_Out800344053|) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800344053, ~y$w_buff1~0=~y$w_buff1~0_In800344053, ~y~0=~y~0_In800344053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800344053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800344053, ~y$w_buff1~0=~y$w_buff1~0_In800344053, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out800344053|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out800344053|, ~y~0=~y~0_In800344053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800344053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:06,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1182918022 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182918022 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1182918022| ~y$w_buff0_used~0_In1182918022) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1182918022|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182918022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182918022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1182918022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182918022, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1182918022|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:06,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1657815750 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1657815750 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1657815750 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1657815750 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1657815750|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1657815750 |P1Thread1of1ForFork1_#t~ite35_Out1657815750|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1657815750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1657815750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1657815750, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657815750} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1657815750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1657815750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1657815750, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1657815750|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657815750} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:06,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-766603448 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-766603448 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-766603448| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-766603448| ~y$r_buff0_thd2~0_In-766603448) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-766603448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766603448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-766603448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766603448, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-766603448|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:06,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1522145690 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1522145690 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1522145690 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1522145690 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1522145690|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1522145690 |P1Thread1of1ForFork1_#t~ite37_Out1522145690|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522145690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522145690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522145690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522145690} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522145690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522145690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522145690, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1522145690|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522145690} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:06,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:06,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~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:04:06,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In344804707 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In344804707 256)))) (or (and (= ~y$w_buff1~0_In344804707 |ULTIMATE.start_main_#t~ite40_Out344804707|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out344804707| ~y~0_In344804707)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In344804707, ~y~0=~y~0_In344804707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344804707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344804707} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out344804707|, ~y$w_buff1~0=~y$w_buff1~0_In344804707, ~y~0=~y~0_In344804707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344804707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344804707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:06,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:06,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-312873409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-312873409 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-312873409|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-312873409 |ULTIMATE.start_main_#t~ite42_Out-312873409|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-312873409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-312873409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-312873409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-312873409, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-312873409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:06,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In421115030 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In421115030 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In421115030 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In421115030 256) 0))) (or (and (= ~y$w_buff1_used~0_In421115030 |ULTIMATE.start_main_#t~ite43_Out421115030|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out421115030|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In421115030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In421115030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In421115030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421115030} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In421115030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In421115030, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out421115030|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In421115030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421115030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:06,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1677871835 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1677871835 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1677871835 |ULTIMATE.start_main_#t~ite44_Out-1677871835|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1677871835|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1677871835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1677871835} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1677871835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1677871835, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1677871835|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:06,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1149795686 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1149795686 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1149795686 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1149795686 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1149795686|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1149795686| ~y$r_buff1_thd0~0_In-1149795686)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149795686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149795686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149795686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149795686} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149795686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149795686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149795686, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1149795686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149795686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:06,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:06,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:04:06 BasicIcfg [2019-11-28 18:04:06,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:04:06,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:04:06,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:04:06,686 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:04:06,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:03:50" (3/4) ... [2019-11-28 18:04:06,689 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:04:06,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t305~0.offset_19|) (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27|) 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t305~0.base_27|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t305~0.base_27| 4)) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t305~0.base_27| 1)) (= v_~y~0_150 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_27|) |v_ULTIMATE.start_main_~#t305~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t305~0.offset=|v_ULTIMATE.start_main_~#t305~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_~#t305~0.base=|v_ULTIMATE.start_main_~#t305~0.base_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t305~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t305~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t306~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t306~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:06,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t306~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t306~0.base_10|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10| 1) |v_#valid_19|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10|) |v_ULTIMATE.start_main_~#t306~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t306~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t306~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t306~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t306~0.offset] because there is no mapped edge [2019-11-28 18:04:06,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd2~0_Out-155891255 ~y$r_buff0_thd2~0_In-155891255) (= 1 ~y$r_buff0_thd1~0_Out-155891255) (= ~x~0_In-155891255 ~__unbuffered_p0_EAX~0_Out-155891255) (= ~y$r_buff1_thd1~0_Out-155891255 ~y$r_buff0_thd1~0_In-155891255) (= ~y$r_buff1_thd0~0_Out-155891255 ~y$r_buff0_thd0~0_In-155891255) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-155891255, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-155891255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-155891255, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255, ~x~0=~x~0_In-155891255} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-155891255, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-155891255, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-155891255, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-155891255, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-155891255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-155891255, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-155891255, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-155891255, ~x~0=~x~0_In-155891255} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:06,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1619876709 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1619876709 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1619876709| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1619876709| ~y$w_buff0_used~0_In1619876709)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1619876709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1619876709} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1619876709|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1619876709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1619876709} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1092762614 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1092762614 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1092762614 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1092762614 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1092762614| ~y$w_buff1_used~0_In-1092762614) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1092762614| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1092762614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092762614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1092762614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092762614} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1092762614|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1092762614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092762614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1092762614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092762614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1822862604 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1822862604 ~y$r_buff0_thd1~0_In1822862604)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1822862604 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1822862604) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1822862604, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1822862604} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1822862604, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1822862604|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1822862604} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:06,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-947433757 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-947433757 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-947433757 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-947433757 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-947433757| ~y$r_buff1_thd1~0_In-947433757)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-947433757| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-947433757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-947433757, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-947433757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947433757} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-947433757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-947433757, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-947433757|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-947433757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947433757} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:06,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:06,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In151085660 256)))) (or (and .cse0 (= ~y$w_buff1~0_In151085660 |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (= |P1Thread1of1ForFork1_#t~ite18_Out151085660| |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In151085660 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In151085660 256))) (= (mod ~y$w_buff0_used~0_In151085660 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In151085660 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In151085660| |P1Thread1of1ForFork1_#t~ite17_Out151085660|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out151085660| ~y$w_buff1~0_In151085660)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In151085660, ~y$w_buff1~0=~y$w_buff1~0_In151085660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151085660, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In151085660, ~weak$$choice2~0=~weak$$choice2~0_In151085660, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In151085660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151085660} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In151085660, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out151085660|, ~y$w_buff1~0=~y$w_buff1~0_In151085660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151085660, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In151085660, ~weak$$choice2~0=~weak$$choice2~0_In151085660, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out151085660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151085660} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:06,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In147144188 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In147144188| |P1Thread1of1ForFork1_#t~ite20_Out147144188|) (= |P1Thread1of1ForFork1_#t~ite21_Out147144188| ~y$w_buff0_used~0_In147144188) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In147144188 256)))) (or (and (= (mod ~y$w_buff1_used~0_In147144188 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In147144188 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In147144188 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out147144188| |P1Thread1of1ForFork1_#t~ite20_Out147144188|) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out147144188| ~y$w_buff0_used~0_In147144188)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147144188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147144188, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In147144188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147144188, ~weak$$choice2~0=~weak$$choice2~0_In147144188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147144188} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147144188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147144188, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out147144188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147144188, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out147144188|, ~weak$$choice2~0=~weak$$choice2~0_In147144188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147144188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:06,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse5 (= (mod ~y$w_buff1_used~0_In-572787936 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-572787936 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-572787936 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-572787936 256))) (.cse3 (= |P1Thread1of1ForFork1_#t~ite23_Out-572787936| |P1Thread1of1ForFork1_#t~ite24_Out-572787936|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-572787936 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-572787936| |P1Thread1of1ForFork1_#t~ite23_Out-572787936|) .cse3 .cse4 (or .cse1 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_Out-572787936| 0))) (and (or (and (= ~y$w_buff1_used~0_In-572787936 |P1Thread1of1ForFork1_#t~ite24_Out-572787936|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-572787936| |P1Thread1of1ForFork1_#t~ite23_In-572787936|)) (and (or (and .cse5 .cse6) (and .cse0 .cse6) .cse2) .cse3 .cse4 (= ~y$w_buff1_used~0_In-572787936 |P1Thread1of1ForFork1_#t~ite23_Out-572787936|))) (= |P1Thread1of1ForFork1_#t~ite22_In-572787936| |P1Thread1of1ForFork1_#t~ite22_Out-572787936|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-572787936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572787936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-572787936, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-572787936|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-572787936|, ~weak$$choice2~0=~weak$$choice2~0_In-572787936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572787936} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-572787936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572787936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-572787936, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-572787936|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-572787936|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-572787936|, ~weak$$choice2~0=~weak$$choice2~0_In-572787936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572787936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:06,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:06,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-126213395 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-126213395| |P1Thread1of1ForFork1_#t~ite29_Out-126213395|) (= ~y$r_buff1_thd2~0_In-126213395 |P1Thread1of1ForFork1_#t~ite30_Out-126213395|) (= |P1Thread1of1ForFork1_#t~ite28_In-126213395| |P1Thread1of1ForFork1_#t~ite28_Out-126213395|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-126213395 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-126213395| |P1Thread1of1ForFork1_#t~ite28_Out-126213395|) (or (not (= (mod ~y$w_buff1_used~0_In-126213395 256) 0)) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-126213395|) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-126213395 256))) .cse1) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-126213395| |P1Thread1of1ForFork1_#t~ite30_Out-126213395|) (not (= 0 (mod ~y$w_buff0_used~0_In-126213395 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-126213395, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-126213395|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-126213395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-126213395, ~weak$$choice2~0=~weak$$choice2~0_In-126213395, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-126213395|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126213395} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-126213395, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-126213395|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-126213395|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-126213395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-126213395, ~weak$$choice2~0=~weak$$choice2~0_In-126213395, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-126213395|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126213395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:06,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:06,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out800344053| |P1Thread1of1ForFork1_#t~ite32_Out800344053|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In800344053 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In800344053 256)))) (or (and (= ~y$w_buff1~0_In800344053 |P1Thread1of1ForFork1_#t~ite32_Out800344053|) .cse0 (not .cse1) (not .cse2)) (and (= ~y~0_In800344053 |P1Thread1of1ForFork1_#t~ite32_Out800344053|) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800344053, ~y$w_buff1~0=~y$w_buff1~0_In800344053, ~y~0=~y~0_In800344053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800344053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800344053, ~y$w_buff1~0=~y$w_buff1~0_In800344053, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out800344053|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out800344053|, ~y~0=~y~0_In800344053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800344053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:06,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1182918022 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182918022 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1182918022| ~y$w_buff0_used~0_In1182918022) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1182918022|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182918022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182918022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1182918022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182918022, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1182918022|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:06,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1657815750 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1657815750 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1657815750 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1657815750 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1657815750|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1657815750 |P1Thread1of1ForFork1_#t~ite35_Out1657815750|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1657815750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1657815750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1657815750, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657815750} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1657815750, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1657815750, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1657815750, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1657815750|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657815750} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:06,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-766603448 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-766603448 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-766603448| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-766603448| ~y$r_buff0_thd2~0_In-766603448) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-766603448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766603448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-766603448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766603448, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-766603448|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:06,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1522145690 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1522145690 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1522145690 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1522145690 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1522145690|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1522145690 |P1Thread1of1ForFork1_#t~ite37_Out1522145690|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522145690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522145690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522145690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522145690} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522145690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1522145690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1522145690, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1522145690|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522145690} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:06,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:06,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~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:04:06,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In344804707 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In344804707 256)))) (or (and (= ~y$w_buff1~0_In344804707 |ULTIMATE.start_main_#t~ite40_Out344804707|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out344804707| ~y~0_In344804707)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In344804707, ~y~0=~y~0_In344804707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344804707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344804707} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out344804707|, ~y$w_buff1~0=~y$w_buff1~0_In344804707, ~y~0=~y~0_In344804707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344804707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344804707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:06,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:06,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-312873409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-312873409 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-312873409|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-312873409 |ULTIMATE.start_main_#t~ite42_Out-312873409|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-312873409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-312873409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-312873409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-312873409, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-312873409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:06,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In421115030 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In421115030 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In421115030 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In421115030 256) 0))) (or (and (= ~y$w_buff1_used~0_In421115030 |ULTIMATE.start_main_#t~ite43_Out421115030|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out421115030|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In421115030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In421115030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In421115030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421115030} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In421115030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In421115030, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out421115030|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In421115030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421115030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:06,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1677871835 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1677871835 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1677871835 |ULTIMATE.start_main_#t~ite44_Out-1677871835|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1677871835|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1677871835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1677871835} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1677871835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1677871835, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1677871835|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:06,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1149795686 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1149795686 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1149795686 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1149795686 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1149795686|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1149795686| ~y$r_buff1_thd0~0_In-1149795686)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149795686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149795686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149795686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149795686} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149795686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149795686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149795686, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1149795686|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149795686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:06,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:06,776 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:04:06,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:04:06,778 INFO L168 Benchmark]: Toolchain (without parser) took 17511.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 496.0 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -372.6 MB). Peak memory consumption was 123.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,778 INFO L168 Benchmark]: CDTParser took 0.34 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:04:06,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,784 INFO L168 Benchmark]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:04:06,785 INFO L168 Benchmark]: RCFGBuilder took 831.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,785 INFO L168 Benchmark]: TraceAbstraction took 15745.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -304.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,786 INFO L168 Benchmark]: Witness Printer took 90.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:06,796 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.34 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 732.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 831.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15745.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -304.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * Witness Printer took 90.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t305, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t306, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1762 SDtfs, 1807 SDslu, 3986 SDs, 0 SdLazy, 3145 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12203occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 6936 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 70653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...