./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_pso.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/rfi007_pso.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 1992a868c6da2ffe537a5cd04b8446faed0d2881 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:24,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:24,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:24,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:24,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:24,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:24,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:24,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:24,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:24,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:24,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:24,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:24,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:24,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:24,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:24,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:24,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:24,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:24,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:24,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:24,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:24,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:24,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:24,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:24,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:24,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:24,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:24,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:24,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:24,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:24,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:24,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:24,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:24,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:24,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:24,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:24,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:24,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:24,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:24,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:24,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:24,862 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:23:24,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:24,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:24,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:24,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:24,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:24,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:24,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:24,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:24,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:24,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:24,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:24,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:24,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:24,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:24,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:24,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:24,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:24,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:24,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:24,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:24,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:24,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:24,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:24,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:24,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:24,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:24,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:24,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:24,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:24,897 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 -> 1992a868c6da2ffe537a5cd04b8446faed0d2881 [2019-11-28 18:23:25,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:25,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:25,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:25,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:25,267 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:25,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc.i [2019-11-28 18:23:25,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5362b705/cfd66ec939594b5cbba6b291cd60778a/FLAGb6a6314ab [2019-11-28 18:23:25,915 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:25,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc.i [2019-11-28 18:23:25,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5362b705/cfd66ec939594b5cbba6b291cd60778a/FLAGb6a6314ab [2019-11-28 18:23:26,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5362b705/cfd66ec939594b5cbba6b291cd60778a [2019-11-28 18:23:26,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:26,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:26,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:26,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:26,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:26,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:26,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b54b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26, skipping insertion in model container [2019-11-28 18:23:26,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:26,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:26,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:26,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:26,751 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:26,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:26,931 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:26,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26 WrapperNode [2019-11-28 18:23:26,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:26,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:26,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:26,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:26,943 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:23:26" (1/1) ... [2019-11-28 18:23:26,966 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:23:26" (1/1) ... [2019-11-28 18:23:27,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:27,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:27,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:27,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:27,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:27,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:27,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:27,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:27,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:27,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (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:23:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:27,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:27,134 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:23:27,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:27,911 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:27,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:27 BoogieIcfgContainer [2019-11-28 18:23:27,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:27,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:27,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:27,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:27,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:26" (1/3) ... [2019-11-28 18:23:27,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c748015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:27, skipping insertion in model container [2019-11-28 18:23:27,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26" (2/3) ... [2019-11-28 18:23:27,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c748015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:27, skipping insertion in model container [2019-11-28 18:23:27,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:27" (3/3) ... [2019-11-28 18:23:27,920 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.oepc.i [2019-11-28 18:23:27,931 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:27,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:27,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:27,940 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:27,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:27,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:28,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:28,087 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:28,087 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:28,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:28,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:28,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:28,088 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:28,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:28,111 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:23:28,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:28,212 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:28,212 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:28,233 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:28,255 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:28,341 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:28,342 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:28,351 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:28,372 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:23:28,374 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:33,076 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:23:33,227 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:23:33,583 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-11-28 18:23:33,583 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-11-28 18:23:33,587 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-11-28 18:23:34,307 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-11-28 18:23:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-11-28 18:23:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:23:34,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:34,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:23:34,336 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:23:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-11-28 18:23:34,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:34,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429157939] [2019-11-28 18:23:34,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:34,745 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:23:34,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429157939] [2019-11-28 18:23:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:34,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:34,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117673031] [2019-11-28 18:23:34,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:34,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:34,777 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-11-28 18:23:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:35,090 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-11-28 18:23:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:35,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:23:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:35,190 INFO L225 Difference]: With dead ends: 9266 [2019-11-28 18:23:35,190 INFO L226 Difference]: Without dead ends: 8258 [2019-11-28 18:23:35,192 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:23:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-11-28 18:23:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-11-28 18:23:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-11-28 18:23:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-11-28 18:23:35,790 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-11-28 18:23:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:35,791 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-11-28 18:23:35,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-11-28 18:23:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:35,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:35,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:35,799 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:23:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-11-28 18:23:35,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:35,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109897655] [2019-11-28 18:23:35,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:35,979 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:23:35,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109897655] [2019-11-28 18:23:35,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:35,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:35,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898243068] [2019-11-28 18:23:35,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:35,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:35,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:35,985 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-11-28 18:23:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:36,559 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-11-28 18:23:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:36,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:36,634 INFO L225 Difference]: With dead ends: 12603 [2019-11-28 18:23:36,635 INFO L226 Difference]: Without dead ends: 12589 [2019-11-28 18:23:36,636 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:23:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-11-28 18:23:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-11-28 18:23:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-11-28 18:23:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-11-28 18:23:37,090 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-11-28 18:23:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,091 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-11-28 18:23:37,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-11-28 18:23:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:23:37,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:37,097 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:23:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-11-28 18:23:37,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:37,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620442834] [2019-11-28 18:23:37,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,184 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:23:37,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620442834] [2019-11-28 18:23:37,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:37,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319432514] [2019-11-28 18:23:37,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:37,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:37,186 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-11-28 18:23:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:37,441 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-11-28 18:23:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:37,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:23:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:37,490 INFO L225 Difference]: With dead ends: 13736 [2019-11-28 18:23:37,490 INFO L226 Difference]: Without dead ends: 13736 [2019-11-28 18:23:37,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-11-28 18:23:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-11-28 18:23:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-11-28 18:23:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-11-28 18:23:37,921 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-11-28 18:23:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,922 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-11-28 18:23:37,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-11-28 18:23:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:37,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,927 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:23:37,927 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:23:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-11-28 18:23:37,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:37,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676420102] [2019-11-28 18:23:37,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,976 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:23:37,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676420102] [2019-11-28 18:23:37,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:37,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446048613] [2019-11-28 18:23:37,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:37,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:37,978 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-11-28 18:23:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,050 INFO L93 Difference]: Finished difference Result 11576 states and 35711 transitions. [2019-11-28 18:23:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:38,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,090 INFO L225 Difference]: With dead ends: 11576 [2019-11-28 18:23:38,090 INFO L226 Difference]: Without dead ends: 11576 [2019-11-28 18:23:38,091 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:23:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2019-11-28 18:23:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 11496. [2019-11-28 18:23:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11496 states. [2019-11-28 18:23:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11496 states to 11496 states and 35479 transitions. [2019-11-28 18:23:38,561 INFO L78 Accepts]: Start accepts. Automaton has 11496 states and 35479 transitions. Word has length 16 [2019-11-28 18:23:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:38,561 INFO L462 AbstractCegarLoop]: Abstraction has 11496 states and 35479 transitions. [2019-11-28 18:23:38,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11496 states and 35479 transitions. [2019-11-28 18:23:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:38,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:38,566 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:23:38,566 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:23:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1184696536, now seen corresponding path program 1 times [2019-11-28 18:23:38,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:38,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257452760] [2019-11-28 18:23:38,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:38,655 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:23:38,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257452760] [2019-11-28 18:23:38,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:38,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:38,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591624861] [2019-11-28 18:23:38,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:38,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:38,659 INFO L87 Difference]: Start difference. First operand 11496 states and 35479 transitions. Second operand 3 states. [2019-11-28 18:23:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,759 INFO L93 Difference]: Finished difference Result 19925 states and 60894 transitions. [2019-11-28 18:23:38,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:38,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,808 INFO L225 Difference]: With dead ends: 19925 [2019-11-28 18:23:38,809 INFO L226 Difference]: Without dead ends: 17497 [2019-11-28 18:23:38,809 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:23:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17497 states. [2019-11-28 18:23:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17497 to 16697. [2019-11-28 18:23:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-11-28 18:23:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 51504 transitions. [2019-11-28 18:23:39,364 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 51504 transitions. Word has length 16 [2019-11-28 18:23:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,364 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 51504 transitions. [2019-11-28 18:23:39,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 51504 transitions. [2019-11-28 18:23:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:23:39,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:39,377 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:23:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-11-28 18:23:39,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702216757] [2019-11-28 18:23:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,487 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:23:39,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702216757] [2019-11-28 18:23:39,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:23:39,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787409815] [2019-11-28 18:23:39,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:39,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:39,490 INFO L87 Difference]: Start difference. First operand 16697 states and 51504 transitions. Second operand 4 states. [2019-11-28 18:23:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:39,528 INFO L93 Difference]: Finished difference Result 3027 states and 7631 transitions. [2019-11-28 18:23:39,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:23:39,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:23:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:39,534 INFO L225 Difference]: With dead ends: 3027 [2019-11-28 18:23:39,534 INFO L226 Difference]: Without dead ends: 2101 [2019-11-28 18:23:39,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-11-28 18:23:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-11-28 18:23:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-11-28 18:23:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4686 transitions. [2019-11-28 18:23:39,574 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4686 transitions. Word has length 17 [2019-11-28 18:23:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,575 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4686 transitions. [2019-11-28 18:23:39,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4686 transitions. [2019-11-28 18:23:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:23:39,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:39,579 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:23:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-11-28 18:23:39,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823610833] [2019-11-28 18:23:39,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,693 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:23:39,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823610833] [2019-11-28 18:23:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394722804] [2019-11-28 18:23:39,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:39,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:39,695 INFO L87 Difference]: Start difference. First operand 2101 states and 4686 transitions. Second operand 6 states. [2019-11-28 18:23:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,283 INFO L93 Difference]: Finished difference Result 5510 states and 12155 transitions. [2019-11-28 18:23:40,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:40,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:23:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,293 INFO L225 Difference]: With dead ends: 5510 [2019-11-28 18:23:40,293 INFO L226 Difference]: Without dead ends: 5475 [2019-11-28 18:23:40,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-11-28 18:23:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 2768. [2019-11-28 18:23:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-11-28 18:23:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6308 transitions. [2019-11-28 18:23:40,363 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6308 transitions. Word has length 25 [2019-11-28 18:23:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,363 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6308 transitions. [2019-11-28 18:23:40,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6308 transitions. [2019-11-28 18:23:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:23:40,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,368 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:23:40,368 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:23:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-11-28 18:23:40,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655850455] [2019-11-28 18:23:40,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:40,497 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:23:40,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655850455] [2019-11-28 18:23:40,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:40,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:40,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28303735] [2019-11-28 18:23:40,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:40,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:40,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:40,500 INFO L87 Difference]: Start difference. First operand 2768 states and 6308 transitions. Second operand 6 states. [2019-11-28 18:23:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,131 INFO L93 Difference]: Finished difference Result 5148 states and 11236 transitions. [2019-11-28 18:23:41,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:41,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:23:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,139 INFO L225 Difference]: With dead ends: 5148 [2019-11-28 18:23:41,140 INFO L226 Difference]: Without dead ends: 5119 [2019-11-28 18:23:41,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-11-28 18:23:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 2810. [2019-11-28 18:23:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-11-28 18:23:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-11-28 18:23:41,329 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 26 [2019-11-28 18:23:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,330 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-11-28 18:23:41,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-11-28 18:23:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:23:41,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:41,336 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:23:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-11-28 18:23:41,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613347848] [2019-11-28 18:23:41,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,428 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:23:41,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613347848] [2019-11-28 18:23:41,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:41,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822314870] [2019-11-28 18:23:41,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:23:41,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:23:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:41,434 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-11-28 18:23:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,490 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-11-28 18:23:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:41,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:23:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,495 INFO L225 Difference]: With dead ends: 1471 [2019-11-28 18:23:41,495 INFO L226 Difference]: Without dead ends: 1312 [2019-11-28 18:23:41,496 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:23:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-28 18:23:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-11-28 18:23:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 18:23:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-11-28 18:23:41,521 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-11-28 18:23:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,524 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-11-28 18:23:41,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:23:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-11-28 18:23:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:41,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,533 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:23:41,533 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:23:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-11-28 18:23:41,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229606193] [2019-11-28 18:23:41,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,635 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:23:41,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229606193] [2019-11-28 18:23:41,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:41,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514119698] [2019-11-28 18:23:41,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:41,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:41,639 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 3 states. [2019-11-28 18:23:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,719 INFO L93 Difference]: Finished difference Result 1065 states and 2362 transitions. [2019-11-28 18:23:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:41,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:23:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,722 INFO L225 Difference]: With dead ends: 1065 [2019-11-28 18:23:41,722 INFO L226 Difference]: Without dead ends: 1065 [2019-11-28 18:23:41,723 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:23:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-11-28 18:23:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 765. [2019-11-28 18:23:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-28 18:23:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1700 transitions. [2019-11-28 18:23:41,745 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1700 transitions. Word has length 52 [2019-11-28 18:23:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,745 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1700 transitions. [2019-11-28 18:23:41,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1700 transitions. [2019-11-28 18:23:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:41,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:41,749 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:23:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-11-28 18:23:41,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030137105] [2019-11-28 18:23:41,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,877 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:23:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030137105] [2019-11-28 18:23:41,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:23:41,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329825147] [2019-11-28 18:23:41,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:23:41,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:23:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:41,880 INFO L87 Difference]: Start difference. First operand 765 states and 1700 transitions. Second operand 7 states. [2019-11-28 18:23:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:42,181 INFO L93 Difference]: Finished difference Result 2590 states and 5569 transitions. [2019-11-28 18:23:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:23:42,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:23:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:42,186 INFO L225 Difference]: With dead ends: 2590 [2019-11-28 18:23:42,186 INFO L226 Difference]: Without dead ends: 1794 [2019-11-28 18:23:42,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:23:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-11-28 18:23:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 888. [2019-11-28 18:23:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 18:23:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1964 transitions. [2019-11-28 18:23:42,206 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1964 transitions. Word has length 53 [2019-11-28 18:23:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:42,206 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1964 transitions. [2019-11-28 18:23:42,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:23:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1964 transitions. [2019-11-28 18:23:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:42,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:42,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:42,209 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:23:42,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 2 times [2019-11-28 18:23:42,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:42,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491216699] [2019-11-28 18:23:42,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:42,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:23:42,388 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:23:42,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1709~0.base_24|) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24|) |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| 4)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= (store .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24| 1) |v_#valid_45|) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24|) 0) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1709~0.offset=|v_ULTIMATE.start_main_~#t1709~0.offset_18|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1709~0.base=|v_ULTIMATE.start_main_~#t1709~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1710~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1709~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1710~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1709~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:42,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:42,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12|) |v_ULTIMATE.start_main_~#t1710~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1710~0.offset_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_12|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1710~0.base, ULTIMATE.start_main_~#t1710~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:23:42,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1269188224 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1269188224 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1269188224|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1269188224 |P0Thread1of1ForFork0_#t~ite5_Out-1269188224|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1269188224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1269188224} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1269188224|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1269188224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1269188224} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:42,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1149606575 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1149606575| ~x$w_buff0~0_In-1149606575) (= |P1Thread1of1ForFork1_#t~ite14_In-1149606575| |P1Thread1of1ForFork1_#t~ite14_Out-1149606575|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1149606575| |P1Thread1of1ForFork1_#t~ite14_Out-1149606575|) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1149606575| ~x$w_buff0~0_In-1149606575) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1149606575 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1149606575 256))) (= 0 (mod ~x$w_buff0_used~0_In-1149606575 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1149606575 256) 0))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1149606575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149606575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1149606575, ~weak$$choice2~0=~weak$$choice2~0_In-1149606575, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1149606575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149606575} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1149606575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149606575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1149606575|, ~weak$$choice2~0=~weak$$choice2~0_In-1149606575, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1149606575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149606575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:42,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1280316891 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1280316891 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1280316891 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1280316891 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out1280316891| ~x$w_buff1_used~0_In1280316891)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1280316891| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280316891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280316891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280316891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280316891} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1280316891|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280316891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280316891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280316891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280316891} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:42,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_In-1173771623 ~x$r_buff0_thd1~0_Out-1173771623)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1173771623 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1173771623 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-1173771623)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1173771623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1173771623} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1173771623, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1173771623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1173771623} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:42,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In-401245270 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-401245270 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-401245270 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-401245270 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-401245270| ~x$r_buff1_thd1~0_In-401245270) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-401245270| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-401245270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-401245270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-401245270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401245270} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-401245270, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-401245270|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-401245270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-401245270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401245270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:42,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:42,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In387429804 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In387429804 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In387429804 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In387429804 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In387429804 256))))) (= |P1Thread1of1ForFork1_#t~ite17_Out387429804| ~x$w_buff1~0_In387429804) (= |P1Thread1of1ForFork1_#t~ite18_Out387429804| |P1Thread1of1ForFork1_#t~ite17_Out387429804|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In387429804| |P1Thread1of1ForFork1_#t~ite17_Out387429804|) (= |P1Thread1of1ForFork1_#t~ite18_Out387429804| ~x$w_buff1~0_In387429804)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In387429804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In387429804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In387429804, ~weak$$choice2~0=~weak$$choice2~0_In387429804, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In387429804, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In387429804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In387429804} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out387429804|, ~x$w_buff1~0=~x$w_buff1~0_In387429804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In387429804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In387429804, ~weak$$choice2~0=~weak$$choice2~0_In387429804, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In387429804, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out387429804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In387429804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:42,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-772746253 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-772746253 256)))) (or (= (mod ~x$w_buff0_used~0_In-772746253 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-772746253 256) 0) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In-772746253 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out-772746253| ~x$w_buff0_used~0_In-772746253) (= |P1Thread1of1ForFork1_#t~ite21_Out-772746253| |P1Thread1of1ForFork1_#t~ite20_Out-772746253|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-772746253| ~x$w_buff0_used~0_In-772746253) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-772746253| |P1Thread1of1ForFork1_#t~ite20_Out-772746253|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-772746253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772746253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-772746253, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-772746253, ~weak$$choice2~0=~weak$$choice2~0_In-772746253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772746253} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-772746253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772746253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-772746253, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-772746253|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-772746253, ~weak$$choice2~0=~weak$$choice2~0_In-772746253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772746253} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-511006154 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-511006154| |P1Thread1of1ForFork1_#t~ite29_Out-511006154|) (= ~x$r_buff1_thd2~0_In-511006154 |P1Thread1of1ForFork1_#t~ite30_Out-511006154|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-511006154| |P1Thread1of1ForFork1_#t~ite30_Out-511006154|) (= |P1Thread1of1ForFork1_#t~ite29_Out-511006154| ~x$r_buff1_thd2~0_In-511006154) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-511006154 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-511006154 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-511006154 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-511006154 256) 0) .cse1))) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-511006154|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-511006154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-511006154, ~weak$$choice2~0=~weak$$choice2~0_In-511006154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-511006154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-511006154} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-511006154|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-511006154|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-511006154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-511006154, ~weak$$choice2~0=~weak$$choice2~0_In-511006154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-511006154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-511006154} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:42,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In960700929 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In960700929 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In960700929 |P1Thread1of1ForFork1_#t~ite32_Out960700929|)) (and (= ~x~0_In960700929 |P1Thread1of1ForFork1_#t~ite32_Out960700929|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In960700929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960700929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In960700929, ~x~0=~x~0_In960700929} OutVars{~x$w_buff1~0=~x$w_buff1~0_In960700929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960700929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In960700929, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out960700929|, ~x~0=~x~0_In960700929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In30974892 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In30974892 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out30974892|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In30974892 |P1Thread1of1ForFork1_#t~ite34_Out30974892|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In30974892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30974892} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out30974892|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In30974892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30974892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-885613869 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-885613869 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-885613869 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-885613869 256) 0))) (or (and (= ~x$w_buff1_used~0_In-885613869 |P1Thread1of1ForFork1_#t~ite35_Out-885613869|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-885613869|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-885613869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-885613869, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-885613869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885613869} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-885613869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-885613869, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-885613869|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-885613869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885613869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In735555286 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In735555286 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out735555286| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out735555286| ~x$r_buff0_thd2~0_In735555286) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In735555286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735555286} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In735555286, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out735555286|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735555286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In303989276 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In303989276 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In303989276 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In303989276 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out303989276| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out303989276| ~x$r_buff1_thd2~0_In303989276) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In303989276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In303989276, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In303989276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In303989276} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In303989276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In303989276, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In303989276, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out303989276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In303989276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In633908278 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In633908278 256)))) (or (and (= ~x~0_In633908278 |ULTIMATE.start_main_#t~ite40_Out633908278|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In633908278 |ULTIMATE.start_main_#t~ite40_Out633908278|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In633908278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In633908278, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In633908278, ~x~0=~x~0_In633908278} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out633908278|, ~x$w_buff1~0=~x$w_buff1~0_In633908278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In633908278, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In633908278, ~x~0=~x~0_In633908278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1646004634 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1646004634 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1646004634| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1646004634 |ULTIMATE.start_main_#t~ite42_Out-1646004634|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1646004634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646004634} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1646004634, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1646004634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646004634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1254543217 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1254543217 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1254543217 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1254543217 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1254543217| ~x$w_buff1_used~0_In-1254543217) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1254543217| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1254543217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1254543217, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1254543217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1254543217} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1254543217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1254543217, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1254543217|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1254543217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1254543217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:42,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1805585142 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1805585142 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1805585142 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1805585142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1805585142} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1805585142, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1805585142|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1805585142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:42,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1061228437 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1061228437 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1061228437 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1061228437 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1061228437| ~x$r_buff1_thd0~0_In1061228437) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1061228437|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1061228437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1061228437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1061228437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1061228437} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1061228437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1061228437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1061228437, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1061228437|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1061228437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:42,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, 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, ~x$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:23:42,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:23:42 BasicIcfg [2019-11-28 18:23:42,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:23:42,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:23:42,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:23:42,471 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:23:42,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:27" (3/4) ... [2019-11-28 18:23:42,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:23:42,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1709~0.base_24|) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_24|) |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1709~0.base_24| 4)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= |v_ULTIMATE.start_main_~#t1709~0.offset_18| 0) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= (store .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24| 1) |v_#valid_45|) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_24|) 0) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1709~0.offset=|v_ULTIMATE.start_main_~#t1709~0.offset_18|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1709~0.base=|v_ULTIMATE.start_main_~#t1709~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1710~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1709~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1710~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1709~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:42,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:42,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12|) |v_ULTIMATE.start_main_~#t1710~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1710~0.offset_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_12|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1710~0.base, ULTIMATE.start_main_~#t1710~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:23:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1269188224 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1269188224 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1269188224|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1269188224 |P0Thread1of1ForFork0_#t~ite5_Out-1269188224|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1269188224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1269188224} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1269188224|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1269188224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1269188224} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1149606575 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1149606575| ~x$w_buff0~0_In-1149606575) (= |P1Thread1of1ForFork1_#t~ite14_In-1149606575| |P1Thread1of1ForFork1_#t~ite14_Out-1149606575|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1149606575| |P1Thread1of1ForFork1_#t~ite14_Out-1149606575|) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1149606575| ~x$w_buff0~0_In-1149606575) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1149606575 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1149606575 256))) (= 0 (mod ~x$w_buff0_used~0_In-1149606575 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1149606575 256) 0))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1149606575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149606575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1149606575, ~weak$$choice2~0=~weak$$choice2~0_In-1149606575, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1149606575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149606575} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1149606575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1149606575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1149606575|, ~weak$$choice2~0=~weak$$choice2~0_In-1149606575, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1149606575, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1149606575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1149606575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1280316891 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1280316891 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1280316891 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1280316891 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out1280316891| ~x$w_buff1_used~0_In1280316891)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1280316891| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280316891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280316891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280316891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280316891} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1280316891|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280316891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280316891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280316891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280316891} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_In-1173771623 ~x$r_buff0_thd1~0_Out-1173771623)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1173771623 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1173771623 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-1173771623)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1173771623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1173771623} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1173771623, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1173771623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1173771623} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In-401245270 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-401245270 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-401245270 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-401245270 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-401245270| ~x$r_buff1_thd1~0_In-401245270) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-401245270| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-401245270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-401245270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-401245270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401245270} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-401245270, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-401245270|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-401245270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-401245270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-401245270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In387429804 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In387429804 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In387429804 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In387429804 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In387429804 256))))) (= |P1Thread1of1ForFork1_#t~ite17_Out387429804| ~x$w_buff1~0_In387429804) (= |P1Thread1of1ForFork1_#t~ite18_Out387429804| |P1Thread1of1ForFork1_#t~ite17_Out387429804|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In387429804| |P1Thread1of1ForFork1_#t~ite17_Out387429804|) (= |P1Thread1of1ForFork1_#t~ite18_Out387429804| ~x$w_buff1~0_In387429804)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In387429804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In387429804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In387429804, ~weak$$choice2~0=~weak$$choice2~0_In387429804, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In387429804, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In387429804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In387429804} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out387429804|, ~x$w_buff1~0=~x$w_buff1~0_In387429804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In387429804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In387429804, ~weak$$choice2~0=~weak$$choice2~0_In387429804, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In387429804, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out387429804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In387429804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-772746253 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-772746253 256)))) (or (= (mod ~x$w_buff0_used~0_In-772746253 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-772746253 256) 0) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In-772746253 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out-772746253| ~x$w_buff0_used~0_In-772746253) (= |P1Thread1of1ForFork1_#t~ite21_Out-772746253| |P1Thread1of1ForFork1_#t~ite20_Out-772746253|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-772746253| ~x$w_buff0_used~0_In-772746253) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-772746253| |P1Thread1of1ForFork1_#t~ite20_Out-772746253|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-772746253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772746253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-772746253, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-772746253, ~weak$$choice2~0=~weak$$choice2~0_In-772746253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772746253} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-772746253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772746253, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-772746253, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-772746253|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-772746253, ~weak$$choice2~0=~weak$$choice2~0_In-772746253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-772746253} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-511006154 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-511006154| |P1Thread1of1ForFork1_#t~ite29_Out-511006154|) (= ~x$r_buff1_thd2~0_In-511006154 |P1Thread1of1ForFork1_#t~ite30_Out-511006154|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-511006154| |P1Thread1of1ForFork1_#t~ite30_Out-511006154|) (= |P1Thread1of1ForFork1_#t~ite29_Out-511006154| ~x$r_buff1_thd2~0_In-511006154) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-511006154 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-511006154 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-511006154 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-511006154 256) 0) .cse1))) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-511006154|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-511006154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-511006154, ~weak$$choice2~0=~weak$$choice2~0_In-511006154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-511006154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-511006154} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-511006154|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-511006154|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-511006154, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-511006154, ~weak$$choice2~0=~weak$$choice2~0_In-511006154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-511006154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-511006154} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In960700929 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In960700929 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In960700929 |P1Thread1of1ForFork1_#t~ite32_Out960700929|)) (and (= ~x~0_In960700929 |P1Thread1of1ForFork1_#t~ite32_Out960700929|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In960700929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960700929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In960700929, ~x~0=~x~0_In960700929} OutVars{~x$w_buff1~0=~x$w_buff1~0_In960700929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960700929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In960700929, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out960700929|, ~x~0=~x~0_In960700929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:42,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In30974892 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In30974892 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out30974892|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In30974892 |P1Thread1of1ForFork1_#t~ite34_Out30974892|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In30974892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30974892} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out30974892|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In30974892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30974892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:42,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-885613869 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-885613869 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-885613869 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-885613869 256) 0))) (or (and (= ~x$w_buff1_used~0_In-885613869 |P1Thread1of1ForFork1_#t~ite35_Out-885613869|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-885613869|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-885613869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-885613869, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-885613869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885613869} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-885613869, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-885613869, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-885613869|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-885613869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885613869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:42,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In735555286 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In735555286 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out735555286| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out735555286| ~x$r_buff0_thd2~0_In735555286) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In735555286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735555286} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In735555286, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out735555286|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735555286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:42,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In303989276 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In303989276 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In303989276 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In303989276 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out303989276| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out303989276| ~x$r_buff1_thd2~0_In303989276) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In303989276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In303989276, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In303989276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In303989276} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In303989276, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In303989276, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In303989276, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out303989276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In303989276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:42,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:42,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:42,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In633908278 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In633908278 256)))) (or (and (= ~x~0_In633908278 |ULTIMATE.start_main_#t~ite40_Out633908278|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In633908278 |ULTIMATE.start_main_#t~ite40_Out633908278|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In633908278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In633908278, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In633908278, ~x~0=~x~0_In633908278} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out633908278|, ~x$w_buff1~0=~x$w_buff1~0_In633908278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In633908278, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In633908278, ~x~0=~x~0_In633908278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:42,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:42,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1646004634 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1646004634 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1646004634| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1646004634 |ULTIMATE.start_main_#t~ite42_Out-1646004634|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1646004634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646004634} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1646004634, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1646004634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646004634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:42,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1254543217 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1254543217 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1254543217 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1254543217 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1254543217| ~x$w_buff1_used~0_In-1254543217) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1254543217| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1254543217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1254543217, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1254543217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1254543217} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1254543217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1254543217, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1254543217|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1254543217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1254543217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:42,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1805585142 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1805585142 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1805585142 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1805585142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1805585142} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1805585142, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1805585142|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1805585142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:42,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1061228437 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1061228437 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1061228437 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1061228437 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1061228437| ~x$r_buff1_thd0~0_In1061228437) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1061228437|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1061228437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1061228437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1061228437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1061228437} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1061228437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1061228437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1061228437, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1061228437|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1061228437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:42,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, 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, ~x$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:23:42,564 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:23:42,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:23:42,566 INFO L168 Benchmark]: Toolchain (without parser) took 16376.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.3 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,567 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:23:42,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:23:42,568 INFO L168 Benchmark]: Boogie Preprocessor took 40.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,573 INFO L168 Benchmark]: RCFGBuilder took 862.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,574 INFO L168 Benchmark]: TraceAbstraction took 14557.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.2 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,574 INFO L168 Benchmark]: Witness Printer took 93.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:42,579 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 741.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 862.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14557.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.2 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. * Witness Printer took 93.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1470 SDtfs, 1659 SDslu, 2739 SDs, 0 SdLazy, 1198 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16697occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 10365 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 30454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...